Best Answer
1 |
def (self, findNums, nums): |
Time complexity:O(n)
Space Complexity: O(3)
for each element x in nums
if the next element y < x
then x and y have same next larget num z if z > x and z > y
if z > y and z < x
pop y
keep x in stack until x been poped, else menas x do not have next larget number
近期评论