zoukankan      html  css  js  c++  java
  • 496. Next Greater Element I

    题目描述:

    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.

    解题思路:

    这题目更应该算是阅读理解题,读懂题意,题目本身不难。

    代码:

     1 class Solution {
     2 public:
     3     vector<int> nextGreaterElement(vector<int>& findNums, vector<int>& nums) {
     4         vector<int> ret(findNums.size(), -1);
     5         for (int i = 0; i < findNums.size(); ++i) {
     6             int j = 0;
     7             int num = -1;
     8             while (nums[j] != findNums[i])
     9                 ++j;
    10             for (int k = j+1; k < nums.size(); ++k) {
    11                 if (nums[k] > findNums[i]) {
    12                     num = nums[k];
    13                     break;
    14                 }
    15             }
    16             ret[i] = num;
    17         }
    18         return ret;
    19     }
    20 };
  • 相关阅读:
    SQL 2005的ROW_NUMBER()实现分页的功能
    UML建模工具集
    挽救崩溃的WinXP操作系统四招
    16个经典面试问题回答思路
    自动关闭弹出式窗口
    在winform中嵌入Flash(swf)的方法及常见问题的解决
    C#获取安装程序所在的路径
    转载:C#操作注册表
    C#实现Dll(OCX)控件自动注册的两种方法
    转载:C#创建和修改注册信息
  • 原文地址:https://www.cnblogs.com/gsz-/p/9502403.html
Copyright © 2011-2022 走看看