LeetCode 496. Next Greater Element I
1 /** 2 * @param {number[]} findNums 3 * @param {number[]} nums 4 * @return {number[]} 5 */ 6 var nextGreaterElement = function(findNums, nums) { 7 let arr = []; 8 let flag = false; 9 for (let i=0; i<findNums.length; i++) { 10 aaa: 11 for (let j=0; j<nums.length; j++) { 12 if (findNums[i]===nums[j]) { 13 for (let k = j+1; k < nums.length; k++) { 14 if(nums[j]<nums[k]) { 15 arr.push(nums[k]); 16 flag = false; 17 break aaa; 18 } 19 } 20 }else { 21 flag = true; 22 } 23 } 24 if (flag) { 25 arr.push(-1); 26 } 27 } 28 return arr; 29 };