[Swift]LeetCode496. 下一个更大元素 I | Next Greater Element I

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/9805282.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

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.

Example 1:

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.

Example 2:

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.

Note:

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

---

 给定两个没有重复元素的数组 nums1 和 nums2 ，其中nums1 是 nums2 的子集。找到 nums1 中每个元素在 nums2 中的下一个比其大的值。

nums1 中数字 x 的下一个更大元素是指 x 在 nums2 中对应位置的右边的第一个比 x 大的元素。如果不存在，对应位置输出-1。

示例 1:

输入: nums1 = [4,1,2], nums2 = [1,3,4,2].
输出: [-1,3,-1]
解释:
    对于num1中的数字4，你无法在第二个数组中找到下一个更大的数字，因此输出 -1。
    对于num1中的数字1，第二个数组中数字1右边的下一个较大数字是 3。
    对于num1中的数字2，第二个数组中没有下一个更大的数字，因此输出 -1。

示例 2:

输入: nums1 = [2,4], nums2 = [1,2,3,4].
输出: [3,-1]
解释:
    对于num1中的数字2，第二个数组中的下一个较大数字是3。
    对于num1中的数字4，第二个数组中没有下一个更大的数字，因此输出 -1。

注意:

1. nums1和nums2中所有元素是唯一的。
2. nums1和nums2 的数组大小都不超过1000。

---

16ms

class Solution {
    func nextGreaterElement(_ findNums: [Int], _ nums: [Int]) -> [Int] {
        
        // 9,8,7,6,5,10 -> 10 is the next greater for all
        var result = [Int]()
        var dict = [Int: Int]()
        var stack = [Int]()
        
        for num in nums {
            while !stack.isEmpty && stack.last! < num {
                let last = stack.removeLast()
                dict[last] = num
            }
            
            stack.append(num)
        }
        
        for num in findNums {
            result.append(dict[num] ?? -1)
        }
        
        return result
    }
}

---

20ms

class Solution {
    func nextGreaterElement(_ findNums: [Int], _ nums: [Int]) -> [Int] {
        
        var ans = [Int]()
        var stack = [Int]()
        var dict = [Int:Int]()
        
        for (index, item) in nums.enumerated() {
            dict[item] = index
            ans.append(0)
        }
        
        for val in nums {
            while stack.count > 0 && val > stack.last! {
                ans[dict[stack.last!]!] = val
                stack.removeLast()
            }
            stack.append(val)
        }
        var newAns = [Int]()
        for val in findNums {
            if let x = dict[val] {
                newAns.append(ans[x]==0 ? -1 : ans[x])
            }
        }
        return newAns
    }
}

---

24ms

class Solution {
    func nextGreaterElement(_ findNums: [Int], _ nums: [Int]) -> [Int] {
        var dict = [Int:Int]()
        var stack = [Int]()
    
        for num in nums {
            while stack.count > 0 && stack.last! < num {
                dict[stack.popLast()!] = num
            }
            stack.append(num)
        }

        return findNums.map { dict[$0] ?? -1 }
    }
}

---

32ms

class Solution {
    func findindex(_ nums: [Int], _ search: Int, _ count: Int) -> Int {
        for i in 0..<count {
            if (nums[i] == search) {
                return i
            }
        }
        return -1
    }
    func nextGreaterElement(_ findNums: [Int], _ nums: [Int]) -> [Int] {
        var output = [Int]()
        var index = -1
        var flag = false
        let count = nums.count
        for i in findNums {
            index = findindex(nums, i, count)
            if (index != (count-1)) {
                flag = false
                for j in nums[index..<count] {
                    if (i<j) {
                        output.append(j)
                        flag = true
                        break
                    }
                }
                if (!flag) {
                    output.append(-1)
                }
            } else {
                output.append(-1)
            }
        }
        return output
    }
}

---

40ms

class Solution {
    func nextGreaterElement(_ nums1: [Int], _ nums2: [Int]) -> [Int] {
        var dict = [Int: Int]()
    
        for (index, num) in nums2.enumerated() {
            dict[num] = index
        }

        var result: [Int] = []
        for num in nums1 {
            var index: Int = dict[num]!
            var max: Int = -1
            while index < nums2.count {
                if num < nums2[index] {
                    max = nums2[index]
                    break
                }

                index += 1
            }

            result.append(max)
        }

        return result
    }
}

---

44ms

class Solution {
    func nextGreaterElement(_ nums1: [Int], _ nums2: [Int]) -> [Int] {
        var nextGreater = [Int]()
        var stack = [Int]()
        var dict = [Int:Int]()

        for num in nums2 {
            while !stack.isEmpty && num > stack.last! {
                dict[stack.removeLast()] = num
            }

            stack.append(num)
        }

        for num in nums1 {
            nextGreater.append(dict[num] ?? -1)
        }

        return nextGreater
    }
}

---

68ms

class Solution {
    func nextGreaterElement(_ findNums: [Int], _ nums: [Int]) -> [Int] {
            var result: [Int] = []
            var item = findNums.count-1
            while item >= 0 {
                var itemResult = -1
                var itemFinded = -1
                for index in 0..<nums.count {
                    if findNums[item] == nums[index] {
                        itemFinded = index
                    }
                    if findNums[item] < nums[index] && itemFinded != -1 {
                        itemResult = nums[index]
                        break
                    }
                }
                result.insert(itemResult, at: 0)
                item = item - 1
            }
            return result
        }
}

---

72ms

class Solution {
    func nextGreaterElement(_ findNums: [Int], _ nums: [Int]) -> [Int] {
         var res:[Int] = []
        for i in 0..<findNums.count {
            for j in 0..<nums.count{
                if findNums[i] == nums[j] {
                    for k in j...nums.count-1 {
                        if (findNums[i] < nums[k]) {
                            res.append(nums[k])
                            break
                        }else if (k == (nums.count-1)){
                            res.append(-1)
                        }
                    }
                    
                }
            }
        }
        return res
    }
}

---

72ms

class Solution {
    func nextGreaterElement(_ nums1: [Int], _ nums2: [Int]) -> [Int] {
        var nextGreater = [Int]()
        var stack = [Int]()
        var dict = [Int:Int]()

        for num in nums2 {
            while !stack.isEmpty && num > stack.last! {
                dict[stack.removeLast()] = num
            }

            stack.append(num)
        }

        for num in nums1 {
            nextGreater.append(dict[num] ?? -1)
        }

        return nextGreater
    }
}