Next Greater Element I
来源:互联网 发布:淘宝 毛毯垫 编辑:程序博客网 时间:2024/05/16 18:50
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.
var nextGreaterElement = function(findNums, nums) { var arr = []; for (var i = 0; i < findNums.length; i++) { arr[i] = -1; for (var j = nums.indexOf(findNums[i]) + 1; j < nums.length; j++) { if (nums[j] > findNums[i]) { arr[i] = nums[j]; break } } } return arr};
0 0
- Next Greater Element I
- Next Greater Element I
- Next Greater Element I
- Next Greater Element I
- Next Greater Element I
- Next Greater Element I
- Next Greater Element I
- Next Greater Element I
- 496. Next Greater Element I
- 496. Next Greater Element I
- LEETCODE--Next Greater Element I
- [LeetCode] Next Greater Element I
- 496. Next Greater Element I
- 496. Next Greater Element I
- LeetCode:Next Greater Element I
- 【leetcode】Next Greater Element I
- 496. Next Greater Element I
- 496. Next Greater Element I
- python3.6安装pyspider出现的问题(pycurl安装失败)和解决方案
- ViewPager图片自动轮播
- 原型深入
- HTTP头部详解
- 深入PHP面向对象、模式与实践——执行及描述任务(1)
- Next Greater Element I
- AngularJS Server
- CentOS7 安装Sublime Text 3
- easyUI(六) -- combobox实现下拉框及其值的获取
- bzoj1433 [ZJOI2009]假期的宿舍
- python anaconda安装与使用
- DP经典应用(二)最长递增子序列问题
- NCL脚本编辑器sublime text3安装攻略补充版
- 匿名函数(lambda)