add 503

Author: luliyucoordinate

README.md

@@ -243,6 +243,7 @@ LeetCode
 |0474|[Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes/) | c | [c++](./src/0474-Ones-and-Zeroes/0474.cpp) |[python](./src/0474-Ones-and-Zeroes/0474.py)|||Medium|
 |0494|[Target Sum](https://leetcode.com/problems/target-sum/) | c | [c++](./src/0494-Target-Sum/0494.cpp) |[python](./src/0494-Target-Sum/0494.py)|||Medium|
 |0496|[Next Greater Element I](https://leetcode.com/problems/next-greater-element-i/) | c | [c++](./src/0496-Next-Greater-Element-I/0496.cpp) |[python](./src/0496-Next-Greater-Element-I/0496.py)|||Easy|
+|0503|[Next Greater Element II](https://leetcode.com/problems/next-greater-element-i/) | c | [c++](./src/0503-Next-Greater-Element-II/0503.cpp) |[python](./src/0503-Next-Greater-Element-II/0503.py)|||Medium|
 |0525|[Contiguous Array](https://leetcode.com/problems/contiguous-array/) | c | [c++](./src/0525-Contiguous-Array/0525.cpp) |[python](./src/0525-Contiguous-Array/0525.py)|||Medium|
 |0560|[Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | c | [c++](./src/0560-Subarray-Sum-Equals-K/0560.cpp) |[python](./src/0560-Subarray-Sum-Equals-K/0560.py)|||Medium|
 |0739|[Daily Temperatures](https://leetcode.com/problems/daily-temperatures/) | c | [c++](./src/0739-Daily-Temperatures/0739.cpp) |[python](./src/0739-Daily-Temperatures/0739.py)|||Medium|

src/0503-Next-Greater-Element-II/0503.cpp

@@ -0,0 +1,22 @@
+#include <vector>
+using namespace std;
+
+static int x = []() {std::ios::sync_with_stdio(false); cin.tie(0); return 0; }();
+class Solution 
+{
+public:
+    vector<int> nextGreaterElements(vector<int>& nums) 
+    {
+        vector<int> stack;
+        vector<int> res(nums.size(), -1);
+        for (int i = 0; i < nums.size()*2; ++i)
+        {
+            while (!stack.empty() and nums[stack.back()] < nums[i%nums.size()])
+            {
+                res[stack.back()] = nums[i%nums.size()]; stack.pop_back();
+            }
+            stack.push_back(i%nums.size());
+        }
+        return res;
+    }
+};

src/0503-Next-Greater-Element-II/0503.py

@@ -0,0 +1,14 @@
+class Solution:
+    def nextGreaterElements(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: List[int]
+        """
+        stack, nums_len = list(), len(nums)
+        res = [-1] * nums_len
+        for i in range(nums_len*2):
+            while stack and nums[stack[-1]] < nums[i%nums_len]:
+                res[stack.pop()] = nums[i%nums_len]
+            stack.append(i%nums_len)
+            
+        return res