edit 62

fishercoder1534 · fishercoder1534 · commit 5d691705bc2d · 2017-06-20T03:59:35.000+09:00
diff --git a/README.md b/README.md
@@ -468,6 +468,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |65|[Valid Number](https://leetcode.com/problems/valid-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_65.java)|O(n)|O(1)|Hard|
 |64|[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_64.java)|O(m*n)|O(m*n)|Medium| DP
 |63|[Unique Paths II](https://leetcode.com/problems/unique-paths-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_63.java)|O(m*n)|O(m*n)|Medium| DP
+|62|[Unique Paths](https://leetcode.com/problems/unique-paths/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_62.java)|O(m*n)|O(m*n)|Medium| DP
 |61|[Rotate List](https://leetcode.com/problems/rotate-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_61.java)|O(n)|O(1)|Medium| Linked List
 |60|[Permutation Sequence](https://leetcode.com/problems/permutation-sequence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_60.java)|?|?|Medium|
 |59|[Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_59.java)|O(n)|O(n)|Medium|
diff --git a/src/main/java/com/fishercoder/solutions/_62.java b/src/main/java/com/fishercoder/solutions/_62.java
@@ -2,14 +2,14 @@
 
 import com.fishercoder.common.utils.CommonUtils;
 
-/**Leetcode 62. Unique Paths
+/**Unique Paths
 
 A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).
-
-The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).
+The robot can only move either down or right at any point in time. The robot is trying to reach
+the bottom-right corner of the grid (marked 'Finish' in the diagram below).
 
 How many possible unique paths are there?*/
-public class UniquePaths {
+public class _62 {
     
     /**Another typical DP question, use a 2d array:
      * the first row and the first column need to be initialized to be 1 since there's only one way to reach every
@@ -44,7 +44,7 @@ public int uniquePaths_merged_for_loop(int m, int n) {
     }
     
     public static void main(String...strings){
-        UniquePaths test = new UniquePaths();
+        _62 test = new _62();
         int m = 1;
         int n = 2;
         System.out.println(test.uniquePaths(m, n));
