c++ solution


  • 0
    W
    class Solution {
    public:
    	vector<int> nextGreaterElements(vector<int>& nums) {
    		vector<int> res;
    		for (int i = 0; i < nums.size(); ++i) {
    			bool found = false;
    			for (int j = (i + 1) % nums.size(), tmp = 0;
    				tmp < nums.size() - 1;
    				j = (j + 1) % nums.size(), ++tmp) {
    				if (nums[j] > nums[i]) {
    					res.push_back(nums[j]);
    					found = true;
    					break;
    				}
    			}
    			if (!found) res.push_back(-1);
    		}
    		return res;
    	}
    };
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.