refactor 503

fishercoder1534 · fishercoder1534 · commit 81fdfac76be5 · 2020-07-15T09:00:55.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_503.java b/src/main/java/com/fishercoder/solutions/_503.java
@@ -2,22 +2,6 @@
 
 import java.util.Stack;
 
-/**
- * 503. Next Greater Element II
- *
- * Given a circular array (the next element of the last element is the first element of the array),
- * print the Next Greater Number for every element.
- * The Next Greater Number of a number x is the first greater number to its traversing-order next in the array,
- * which means you could search circularly to find its next greater number. If it doesn't exist, output -1 for this number.
-
- Example 1:
- Input: [1,2,1]
- Output: [2,-1,2]
- Explanation: The first 1's next greater number is 2;
- The number 2 can't find next greater number;
- The second 1's next greater number needs to search circularly, which is also 2.
- Note: The length of given array won't exceed 10000.
- */
 public class _503 {
 
     public static class Solution1 {
