change names

fishercoder1534 · fishercoder1534 · commit 80bf1d98ec92 · 2017-06-14T07:41:59.000-07:00
diff --git a/README.md b/README.md
@@ -489,8 +489,8 @@ Your ideas/fixes/algorithms are more than welcome!
 |35|[Search Insert Position](https://leetcode.com/problems/search-insert-position/)|[Solution](../master/src/main/java/com/fishercoder/solutions/SearchInsertPosition.java)|O(n)|O(1)|Medium|Array
 |34|[Search for a Range](https://leetcode.com/problems/search-for-a-range/)|[Solution](../master/src/main/java/com/fishercoder/solutions/SearchForARange.java)|O(logn)|O(1)|Medium|Array, Binary Search
 |33|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_33.java)|O(logn)|O(1)|Medium|Binary Search
-|32|[Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/)|[Solution](../master/src/main/java/com/fishercoder/solutions/LongestValidParentheses.java)|O(n)|O(n)|Hard|Stack, DP
-|31|[Next Permutation](https://leetcode.com/problems/next-permutation)|[Solution](../master/src/main/java/com/fishercoder/solutions/NextPermutation.java)|O(n)|O(1)|Medium|Array
+|32|[Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_32.java)|O(n)|O(n)|Hard|Stack, DP
+|31|[Next Permutation](https://leetcode.com/problems/next-permutation)|[Solution](../master/src/main/java/com/fishercoder/solutions/_31.java)|O(n)|O(1)|Medium|Array
 |30|[Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_30.java)|O(n^2)|O(n)|Hard| HashMap
 |29|[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_29.java)|O(?)|O(?)|Medium|
 |28|[Implement strStr()](https://leetcode.com/problems/implement-strstr/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_28.java)|O(n)|O(1)|Easy| String
diff --git a/src/main/java/com/fishercoder/solutions/_31.java b/src/main/java/com/fishercoder/solutions/_31.java
@@ -12,7 +12,7 @@ If such arrangement is not possible, it must rearrange it as the lowest possible
 1,2,3 → 1,3,2
 3,2,1 → 1,2,3
 1,1,5 → 1,5,1*/
-public class NextPermutation {
+public class _31 {
     /**Leetcode has a very good article to illustrate this problem and with animation: https://leetcode.com/articles/next-permutation/
      * 1. if the array is already in decrementing order, then there's no next larger permutation possible. 
      * 2. if not, start from the end of the array, find the first pair of numbers that break the decrementing order
diff --git a/src/main/java/com/fishercoder/solutions/_32.java b/src/main/java/com/fishercoder/solutions/_32.java
@@ -9,7 +9,7 @@
 
  Another example is ")()())", where the longest valid parentheses substring is "()()", which has length = 4.
  */
-public class LongestValidParentheses {
+public class _32 {
 	public int longestValidParentheses(String s) {
 		int result = 0;
 		Stack<Integer> stack = new Stack();
