Leetcode #496 Next Greater Element I

Description

You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1’s elements in the corresponding places of nums2.

The Next Greater Number of a number x in nums1 is the first greater number to its right in nums2. If it does not exist, output -1 for this number.

Note

• All elements in nums1 and nums2 are unique.
• The length of both nums1 and nums2 would not exceed 1000.

Example

Input: nums1 = [4,1,2], nums2 = [1,3,4,2].
Output: [-1,3,-1]
Explanation:
For number 4 in the first array, you cannot find the next greater number for it in the second array, so output -1.
For number 1 in the first array, the next greater number for it in the second array is 3.
For number 2 in the first array, there is no next greater number for it in the second array, so output -1.

Input: nums1 = [2,4], nums2 = [1,2,3,4].
Output: [3,-1]
Explanation:
For number 2 in the first array, the next greater number for it in the second array is 3.
For number 4 in the first array, there is no next greater number for it in the second array, so output -1.

Explain

用一个数组预处理findNums中元素在Nums中的位置，复杂度O（n^2），后处理比该数大的数，复杂度O（n^2），总复杂度O（n^2），如果不做预处理直接在处理大的数中找位置复杂度为O（n^3）

Code

class Solution(object):
    def nextGreaterElement(self, findNums, nums):
        """
        :type findNums: List[int]
        :type nums: List[int]
        :rtype: List[int]
        """
        num_pos = []
        res = []
        for x in findNums:
            for i,y in enumerate(nums):
                if x == y:
                    num_pos.append(i)
                    break
        len_num = len(nums)
        for i,x in enumerate(findNums):
            for j in range(num_pos[i],len_num):
                if x < nums[j]:
                    res.append(nums[j])
                    break
            else:
                res.append(-1)
        return res