class Solution {public int[] nextGreaterElements(int[] nums) {int len = nums.length;int[] res = new int[len];Arrays.fill(res,-1);for(int i = 0;i<len;i++){int index = i+1;int target = nums[i];for(int j = 0;j<len;j++){if(nums[index%len]>target){res[i] = nums[index%len];break;}index++;}}return res;}
}

42. 接雨水   

题目：给定 n 个非负整数表示每个宽度为 1 的柱子的高度图，计算按此排列的柱子，下雨之后能接多少雨水。 

class Solution {public int trap(int[] height) {int len = height.length;int sum = 0;for (int i = 1; i < height.length - 1; i++) {int max_left = -1;int target_left = height[i];for (int j = i - 1; j >= 0; j--) {if (height[j] >= target_left) {max_left = j;target_left = height[j];}}int max_right = -1;int target_right = height[i];for (int j = i + 1; j < len; j++) {if (height[j] >= target_right) {max_right = j;target_right = height[j];}}if (max_left != -1 && max_right != -1) {int min = Math.min(height[max_right], height[max_left]);sum = sum + min - height[i];}}return sum;}
}