rename

fishercoder1534 · fishercoder1534 · commit 363ad625ba4c · 2017-07-28T16:10:49.000-07:00
diff --git a/README.md b/README.md
@@ -267,7 +267,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |332|[Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_332.java)| O(n)|O(n) | Medium| Graph, DFS
 |331|[Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_331.java)| O(n)|O(n) | Medium| Stack
 |330|[Patching Array](https://leetcode.com/problems/patching-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_330.java)| O(m+logn)|O(1) | Hard| Greedy
-|329|[Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/LongestIncreasingPathInAMatrix.java)| O(?)|O(?) | Hard|
+|329|[Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_329.java)| O(?)|O(?) | Hard|
 |328|[Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_328.java)| O(n)|O(1) | Medium| Linked List
 |327|[Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_327.java)| O(?)|O(?) | Hard|
 |326|[Power of Three](https://leetcode.com/problems/power-of-three/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_326.java)| O(1)|O(1) | Easy| Math
diff --git a/src/main/java/com/fishercoder/solutions/_329.java b/src/main/java/com/fishercoder/solutions/_329.java
@@ -23,7 +23,7 @@
  ]
  Return 4
  The longest increasing path is [3, 4, 5, 6]. Moving diagonally is not allowed.*/
-public class LongestIncreasingPathInAMatrix {
+public class _329 {
 //inspired by this solution: https://discuss.leetcode.com/topic/34835/15ms-concise-java-solution, wrote it myself:
 
     final int dirs[] = new int[]{0, 1, 0, -1, 0};

Original file line number	Diff line number	Diff line change
`@@ -23,7 +23,7 @@`
`23`	`23`	`]`
`24`	`24`	`Return 4`
`25`	`25`	`The longest increasing path is [3, 4, 5, 6]. Moving diagonally is not allowed.*/`
`26`		`-public class LongestIncreasingPathInAMatrix {`
	`26`	`+public class _329 {`
`27`	`27`	`//inspired by this solution: https://discuss.leetcode.com/topic/34835/15ms-concise-java-solution, wrote it myself:`
`28`	`28`
`29`	`29`	`final int dirs[] = new int[]{0, 1, 0, -1, 0};`