clean up

fishercoder1534 · fishercoder1534 · commit fdecb5bdd895 · 2017-06-15T11:42:45.000-07:00
diff --git a/README.md b/README.md
@@ -455,40 +455,40 @@ Your ideas/fixes/algorithms are more than welcome!
 |73|[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_73.java)|O(mn)|O(mn)|Medium|
 |72|[Edit Distance](https://leetcode.com/problems/edit-distance/)|[Solution](../master/src/main/java/com/fishercoder/solutions/EditDistance.java)|O(m*n)|O(m+n)|Hard| 
 |71|[Simplify Path](https://leetcode.com/problems/simplify-path/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_71.java)|O(n)|O(n)|Medium| Stack
-|70|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/ClimbingStairs.java)|O(n)|O(n)|Easy| DP
-|69|[Sqrt(x)](https://leetcode.com/problems/sqrtx/)|[Solution](../master/src/main/java/com/fishercoder/solutions/Sqrt.java)|O(logn)|O(1)|Easy|
-|68|[Text Justification](https://leetcode.com/problems/text-justification/)|[Solution](../master/src/main/java/com/fishercoder/solutions/TextJustification.java)|O(n)|O(1)|Hard|
+|70|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_70.java)|O(n)|O(n)|Easy| DP
+|69|[Sqrt(x)](https://leetcode.com/problems/sqrtx/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_69.java)|O(logn)|O(1)|Easy|
+|68|[Text Justification](https://leetcode.com/problems/text-justification/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_68.java)|O(n)|O(1)|Hard|
 |67|[Add Binary](https://leetcode.com/problems/add-binary/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_67.java)|O(n)|O(1)|Easy|
-|66|[Plus One](https://leetcode.com/problems/plus-one/)|[Solution](../master/src/main/java/com/fishercoder/solutions/PlusOne.java)|O(n)|O(1)|Easy|
+|66|[Plus One](https://leetcode.com/problems/plus-one/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_66.java)|O(n)|O(1)|Easy|
 |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/MinimumPathSum.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/UniquePathsII.java)|O(m*n)|O(m*n)|Medium| DP
+|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
 |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/PermutationSequence.java)|?|?|Medium|
-|59|[Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/SpiralMatrixII.java)|O(n)|O(n)|Medium|
-|58|[Length of Last Word](https://leetcode.com/problems/length-of-last-word/)|[Solution](../master/src/main/java/com/fishercoder/solutions/LengthofLastWord.java)|O(n)|O(1)|Easy|
+|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|
+|58|[Length of Last Word](https://leetcode.com/problems/length-of-last-word/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_58.java)|O(n)|O(1)|Easy|
 |57|[Insert Intervals](https://leetcode.com/problems/insert-interval/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_57.java)|O(n)|O(1)|Hard| Array, Sort
 |56|[Merge Intervals](https://leetcode.com/problems/merge-intervals/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_56.java)|O(n*logn)|O(1)|Medium| Array, Sort
 |55|[Jump Game](https://leetcode.com/problems/jump-game/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_55.java)|O(n)|O(1)|Medium| Greedy
 |54|[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_54.java)|O(m*n)|O(m*n)|Medium| Array
 |53|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_53.java)|O(n)|O(1)|Easy|
-|50|[Pow(x, n)](https://leetcode.com/problems/powx-n/)|[Solution](../master/src/main/java/com/fishercoder/solutions/PowXN.java)|O(logn)|O(logn)|Medium|
+|50|[Pow(x, n)](https://leetcode.com/problems/powx-n/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_50.java)|O(logn)|O(logn)|Medium|
 |49|[Group Anagrams](https://leetcode.com/problems/anagrams/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_49.java)|O(m*logn)|O(m*n)|Medium| HashMap
 |48|[Rotate Image](https://leetcode.com/problems/rotate-image/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_48.java)|O(n^2)|O(1)|Medium|Array
 |47|[Permutations II](https://leetcode.com/problems/permutations-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_47.java)|O(n*n!)|O(n)|Medium|Backtracking
 |46|[Permutations](https://leetcode.com/problems/permutations/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_46.java)|O(n*n!)|O(n)|Medium|Backtracking
-|45|[Jump Game II](https://leetcode.com/problems/jump-game-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/JumpGameII.java)|O(?)|O(?)|Hard|
+|45|[Jump Game II](https://leetcode.com/problems/jump-game-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_45.java)|O(?)|O(?)|Hard|
 |44|[Wildcard Matching](https://leetcode.com/problems/wildcard-matching/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_44.java)|O(m*n)|O(m*n)|Hard| Backtracking, DP, Greedy, String
 |43|[Multiply Strings](https://leetcode.com/problems/multiply-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_43.java)|O(n)|O(1)|Medium| Array, String
-|42|[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/)|[Solution](../master/src/main/java/com/fishercoder/solutions/TrappingRainWater.java)|O(n)|O(1)|Hard|
-|41|[First Missing Positive](https://leetcode.com/problems/first-missing-positive/)|[Solution](../master/src/main/java/com/fishercoder/solutions/FirstMissingPositive.java)|O(n)|O(1)|Hard|
-|40|[Combination Sum II](https://leetcode.com/problems/combination-sum-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/CombinationSumII.java)|O(k*n^k)|O(k)|Medium|Backtracking
-|39|[Combination Sum](https://leetcode.com/problems/combination-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/CombinationSum.java)|O(k*n^k)|O(k)|Medium|Backtracking
-|38|[Count and Say](https://leetcode.com/problems/count-and-say/)|[Solution](../master/src/main/java/com/fishercoder/solutions/CountandSay.java)|O(n*2^n)|O(2^n)|Easy| Recursion, LinkedList
-|37|[Sudoku Solver](https://leetcode.com/problems/sudoku-solver/)|[Solution](../master/src/main/java/com/fishercoder/solutions/SudokuSolver.java)|O((9!)^9)|O(1)|Hard|
+|42|[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_42.java)|O(n)|O(1)|Hard|
+|41|[First Missing Positive](https://leetcode.com/problems/first-missing-positive/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_41.java)|O(n)|O(1)|Hard|
+|40|[Combination Sum II](https://leetcode.com/problems/combination-sum-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_40.java)|O(k*n^k)|O(k)|Medium|Backtracking
+|39|[Combination Sum](https://leetcode.com/problems/combination-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_39.java)|O(k*n^k)|O(k)|Medium|Backtracking
+|38|[Count and Say](https://leetcode.com/problems/count-and-say/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_38.java)|O(n*2^n)|O(2^n)|Easy| Recursion, LinkedList
+|37|[Sudoku Solver](https://leetcode.com/problems/sudoku-solver/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_37.java)|O((9!)^9)|O(1)|Hard|
 |36|[Valid Sudoku](https://leetcode.com/problems/valid-sudoku/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_36.java)|O(1)|O(1)|Medium| 
-|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
+|35|[Search Insert Position](https://leetcode.com/problems/search-insert-position/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_35.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/_34.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/_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
diff --git a/src/main/java/com/fishercoder/solutions/_34.java b/src/main/java/com/fishercoder/solutions/_34.java
@@ -12,7 +12,7 @@
  Given [5, 7, 7, 8, 8, 10] and target value 8,
  return [3, 4].
  */
-public class SearchForARange {
+public class _34 {
 
     public static int[] searchRange(int[] nums, int target) {
         int start = 0, end = nums.length-1;
diff --git a/src/main/java/com/fishercoder/solutions/_35.java b/src/main/java/com/fishercoder/solutions/_35.java
@@ -11,7 +11,7 @@
  [1,3,5,6], 7 → 4
  [1,3,5,6], 0 → 0
  */
-public class SearchInsertPosition {
+public class _35 {
 
     public int searchInsert(int[] A, int target) {
         int len = A.length;
diff --git a/src/main/java/com/fishercoder/solutions/_37.java b/src/main/java/com/fishercoder/solutions/_37.java
@@ -7,7 +7,7 @@
   * A sudoku puzzle...
  * ...and its solution numbers marked in red.
  */
-public class SudokuSolver {
+public class _37 {
 
     public void solveSudoku(char[][] board) {
         if (board == null || board.length == 0) return;
diff --git a/src/main/java/com/fishercoder/solutions/_38.java b/src/main/java/com/fishercoder/solutions/_38.java
@@ -1,6 +1,6 @@
 package com.fishercoder.solutions;
 
-public class CountandSay {
+public class _38 {
 /**The count-and-say sequence is the sequence of integers beginning as follows:
  1, 11, 21, 1211, 111221, ...
 
diff --git a/src/main/java/com/fishercoder/solutions/_39.java b/src/main/java/com/fishercoder/solutions/_39.java
@@ -19,7 +19,7 @@ All numbers (including target) will be positive integers.
  [7],
  [2, 2, 3]
  ]*/
-public class CombinationSum {
+public class _39 {
 
     public List<List<Integer>> combinationSum(int[] candidates, int target) {
         List<List<Integer>> result = new ArrayList();
@@ -46,7 +46,7 @@ private void backtracking(int[] candidates, int target, int startIndex, List<Int
 
     
     public static void main(String...args){
-        CombinationSum test = new CombinationSum();
+        _39 test = new _39();
         int[] candidates = new int[]{2,3,6,7};
         int target = 7;
         List<List<Integer>> result = test.combinationSum(candidates, target);
diff --git a/src/main/java/com/fishercoder/solutions/_40.java b/src/main/java/com/fishercoder/solutions/_40.java
@@ -20,7 +20,7 @@ All numbers (including target) will be positive integers.
  [2, 6],
  [1, 1, 6]
  ]*/
-public class CombinationSumII {
+public class _40 {
 
     public List<List<Integer>> combinationSum2(int[] candidates, int target) {
         List<List<Integer>> result = new ArrayList();
@@ -44,7 +44,7 @@ void helper(int[] candidates, int target, int start, List<Integer> curr, List<Li
     }
 
     public static void main(String...args){
-        CombinationSumII test = new CombinationSumII();
+        _40 test = new _40();
         int[] candidates = new int[]{10,1,2,7,6,1,5};
         int target = 8;
         List<List<Integer>> result = test.combinationSum2(candidates, target);
diff --git a/src/main/java/com/fishercoder/solutions/_41.java b/src/main/java/com/fishercoder/solutions/_41.java
@@ -10,7 +10,7 @@
  Your algorithm should run in O(n) time and uses constant space.
 
  */
-public class FirstMissingPositive {
+public class _41 {
 
     public int firstMissingPositive(int[] A) {
         int i = 0;
diff --git a/src/main/java/com/fishercoder/solutions/_42.java b/src/main/java/com/fishercoder/solutions/_42.java
@@ -9,7 +9,7 @@
 
  The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. Thanks Marcos for contributing this image!
  */
-public class TrappingRainWater {
+public class _42 {
 
     public int trap(int[] height) {
         int len = height.length;
diff --git a/src/main/java/com/fishercoder/solutions/_45.java b/src/main/java/com/fishercoder/solutions/_45.java
@@ -15,7 +15,7 @@
  Note:
  You can assume that you can always reach the last index.
  */
-public class JumpGameII {
+public class _45 {
 
     public int jump(int[] A) {
         int jumps = 0;
diff --git a/src/main/java/com/fishercoder/solutions/_50.java b/src/main/java/com/fishercoder/solutions/_50.java
@@ -3,7 +3,7 @@
 /**
  * Implement pow(x, n).
  */
-public class PowXN {
+public class _50 {
 
     public double myPow(double x, int n) {
         if(n == 0)
diff --git a/src/main/java/com/fishercoder/solutions/_58.java b/src/main/java/com/fishercoder/solutions/_58.java
@@ -8,7 +8,7 @@
  For example,
  Given s = "Hello World",
  return 5.*/
-public class LengthofLastWord {
+public class _58 {
 
     public int lengthOfLastWord(String s) {
         if(s == null || s.length() == 0) return 0;
diff --git a/src/main/java/com/fishercoder/solutions/_59.java b/src/main/java/com/fishercoder/solutions/_59.java
@@ -13,7 +13,7 @@
  [ 7, 6, 5 ]
  ]
  */
-public class SpiralMatrixII {
+public class _59 {
 
     public int[][] generateMatrix(int num) {
         int temp = num;
diff --git a/src/main/java/com/fishercoder/solutions/_60.java b/src/main/java/com/fishercoder/solutions/_60.java
@@ -16,7 +16,7 @@ We get the following sequence (ie, for n = 3):
 
  Note: Given n will be between 1 and 9 inclusive.
  */
-public class PermutationSequence {
+public class _60 {
 
     public String getPermutation(int n, int k) {
         int[] nums = new int[n + 1];
diff --git a/src/main/java/com/fishercoder/solutions/_63.java b/src/main/java/com/fishercoder/solutions/_63.java
@@ -21,7 +21,7 @@
 The total number of unique paths is 2.
 
 Note: m and n will be at most 100.*/
-public class UniquePathsII {
+public class _63 {
     /**Idea: grid[i][j] has to be set to zero if obstacleGrid[i][j] == 1,
      * otherwise, we can get dp[i][j] from its top and left dp.*/
     public int uniquePathsWithObstacles(int[][] obstacleGrid) {
@@ -53,7 +53,7 @@ public int uniquePathsWithObstacles(int[][] obstacleGrid) {
     }
     
     public static void main(String...strings){
-        UniquePathsII test = new UniquePathsII();
+        _63 test = new _63();
 //        int[][] obstacleGrid = new int[3][3];
 //        obstacleGrid[0][0] = 0;
 //        obstacleGrid[0][1] = 0;
diff --git a/src/main/java/com/fishercoder/solutions/_64.java b/src/main/java/com/fishercoder/solutions/_64.java
@@ -7,8 +7,8 @@
 Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.
 
 Note: You can only move either down or right at any point in time.*/
-public class MinimumPathSum {
-    /**Same idea as ClimbingStairs, also typical trick:
+public class _64 {
+    /**Same idea as _70, also typical trick:
      * have to initialize the first row and the first column and start the for loop from i==1 and j==1 for the rest
      * of the matrix.*/
     public int minPathSum(int[][] grid) {
@@ -33,7 +33,7 @@ public int minPathSum(int[][] grid) {
     }
     
     public static void main(String...strings){
-        MinimumPathSum test = new MinimumPathSum();
+        _64 test = new _64();
 //        int[][] grid = new int[2][2];
 //        grid[0][0] = 1;
 //        grid[0][1] = 2;
diff --git a/src/main/java/com/fishercoder/solutions/_66.java b/src/main/java/com/fishercoder/solutions/_66.java
@@ -6,7 +6,7 @@
 Given a non-negative number represented as an array of digits, plus one to the number.
 
 The digits are stored such that the most significant digit is at the head of the list.*/
-public class PlusOne {
+public class _66 {
     //also looked at Discuss, basically the same idea as mine, just their code is more concise.
     
     public int[] plusOne(int[] digits) {
@@ -43,7 +43,7 @@ public int[] plusOne(int[] digits) {
     }
     
     public static void main(String...strings){
-        PlusOne test = new PlusOne();
+        _66 test = new _66();
 //        int[] digits = new int[]{9,9,9,9};
 //        int[] digits = new int[]{8,9,9,9};
         int[] digits = new int[]{2,4,9,3,9};
diff --git a/src/main/java/com/fishercoder/solutions/_68.java b/src/main/java/com/fishercoder/solutions/_68.java
@@ -27,7 +27,7 @@
  A line other than the last line might contain only one word. What should you do in this case?
  In this case, that line should be left-justified.
  */
-public class TextJustification {
+public class _68 {
 
     public static List<String> fullJustify(String[] words, int L) {
         ArrayList<String> result = new ArrayList();
diff --git a/src/main/java/com/fishercoder/solutions/_69.java b/src/main/java/com/fishercoder/solutions/_69.java
@@ -7,7 +7,7 @@
 
  * Created by fishercoder on 1/25/17.
  */
-public class Sqrt {
+public class _69 {
     public int mySqrt(int x) {
         long i = 0, j = x/2+1;
         while(i <= j){
diff --git a/src/main/java/com/fishercoder/solutions/_70.java b/src/main/java/com/fishercoder/solutions/_70.java
@@ -3,7 +3,7 @@
 /**Leetcode 70: You are climbing a stair case. It takes n steps to reach to the top.
 
 Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?*/
-public class ClimbingStairs {
+public class _70 {
     //classical dp problem
     public int climbStairs(int n) {
         if(n < 1) return 0;
@@ -19,7 +19,7 @@ public int climbStairs(int n) {
     }
 
     public static void main(String... strings) {
-        ClimbingStairs test = new ClimbingStairs();
+        _70 test = new _70();
         System.out.println(test.climbStairs(6));
     }
 }
diff --git a/src/test/java/com/fishercoder/SqrtxTest.java b/src/test/java/com/fishercoder/SqrtxTest.java
@@ -1,6 +1,6 @@
 package com.fishercoder;
 
-import com.fishercoder.solutions.Sqrt;
+import com.fishercoder.solutions._69;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
@@ -11,14 +11,14 @@
  * Created by fishercoder on 1/25/17.
  */
 public class SqrtxTest {
-    private static Sqrt test;
+    private static _69 test;
     private static int expected;
     private static int actual;
     private static int input;
 
     @BeforeClass
     public static void setup(){
-        test = new Sqrt();
+        test = new _69();
     }
 
     @Before
