rename package

src/main/java/com/stevesun/common/classes/Interval.java → src/main/java/com/fishercoder/common/classes/Interval.java

@@ -1,4 +1,4 @@
-package com.stevesun.common.classes;
+package com.fishercoder.common.classes;
 
 /**This is a class used by one OJ problem: MeetingRooms*/
 public class Interval implements Comparable<Interval> {

src/main/java/com/stevesun/common/classes/ListNode.java → src/main/java/com/fishercoder/common/classes/ListNode.java

@@ -1,6 +1,6 @@
-package com.stevesun.common.classes;
+package com.fishercoder.common.classes;
 
-import com.stevesun.common.utils.CommonUtils;
+import com.fishercoder.common.utils.CommonUtils;
 
 import java.util.List;
 

src/main/java/com/stevesun/common/classes/NestedInteger.java → src/main/java/com/fishercoder/common/classes/NestedInteger.java

@@ -1,4 +1,4 @@
-package com.stevesun.common.classes;
+package com.fishercoder.common.classes;
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/com/stevesun/common/classes/Point.java → src/main/java/com/fishercoder/common/classes/Point.java

@@ -1,7 +1,7 @@
-package com.stevesun.common.classes;
+package com.fishercoder.common.classes;
 
 /**
- * Created by stevesun on 12/31/16.
+ * Created by fishercoder on 12/31/16.
  */
 public class Point {
     public int x;

src/main/java/com/stevesun/common/classes/Reader4.java → src/main/java/com/fishercoder/common/classes/Reader4.java

@@ -1,4 +1,4 @@
-package com.stevesun.common.classes;
+package com.fishercoder.common.classes;
 
 public class Reader4 {
     public int read4(char[] buf){

src/main/java/com/stevesun/common/classes/TreeLinkNode.java → src/main/java/com/fishercoder/common/classes/TreeLinkNode.java

@@ -1,4 +1,4 @@
-package com.stevesun.common.classes;
+package com.fishercoder.common.classes;
 
 /**
  * Created by fishercoder1534 on 10/5/16.

src/main/java/com/stevesun/common/classes/TreeNode.java → src/main/java/com/fishercoder/common/classes/TreeNode.java

@@ -1,4 +1,4 @@
-package com.stevesun.common.classes;
+package com.fishercoder.common.classes;
 
 public class TreeNode {
     public int val;

src/main/java/com/stevesun/common/classes/UndirectedGraphNode.java → src/main/java/com/fishercoder/common/classes/UndirectedGraphNode.java

@@ -1,4 +1,4 @@
-package com.stevesun.common.classes;
+package com.fishercoder.common.classes;
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/com/stevesun/common/utils/BTreePrinter.java → src/main/java/com/fishercoder/common/utils/BTreePrinter.java

@@ -1,7 +1,7 @@
 /**
  * 
  */
-package com.stevesun.common.utils;
+package com.fishercoder.common.utils;
 
 import java.util.ArrayList;
 import java.util.Collections;

src/main/java/com/stevesun/common/utils/CommonUtils.java → src/main/java/com/fishercoder/common/utils/CommonUtils.java

@@ -1,6 +1,6 @@
-package com.stevesun.common.utils;
+package com.fishercoder.common.utils;
 
-import com.stevesun.common.classes.ListNode;
+import com.fishercoder.common.classes.ListNode;
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/com/stevesun/common/utils/Notes.java → src/main/java/com/fishercoder/common/utils/Notes.java

@@ -1,7 +1,7 @@
 /**
  * 
  */
-package com.stevesun.common.utils;
+package com.fishercoder.common.utils;
 
 import java.lang.annotation.Retention;
 import java.lang.annotation.RetentionPolicy;

src/main/java/com/stevesun/common/utils/TreeUtils.java → src/main/java/com/fishercoder/common/utils/TreeUtils.java

@@ -1,9 +1,9 @@
 /**
  * 
  */
-package com.stevesun.common.utils;
+package com.fishercoder.common.utils;
 
-import com.stevesun.common.classes.TreeNode;
+import com.fishercoder.common.classes.TreeNode;
 
 import java.util.*;
 

src/main/java/com/stevesun/solutions/AlienDictionary.java → src/main/java/com/fishercoder/solutions/AlienDictionary.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 import java.util.*;
 

src/main/java/com/stevesun/solutions/AllOOneDataStructure.java → src/main/java/com/fishercoder/solutions/AllOOneDataStructure.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 /**
  * Implement a data structure supporting the following operations:

src/main/java/com/stevesun/solutions/AndroidUnlockPatterns.java → src/main/java/com/fishercoder/solutions/AndroidUnlockPatterns.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 /**
  * Given an Android 3x3 key lock screen and two integers m and n, where 1 ≤ m ≤ n ≤ 9, count the total number of unlock patterns of the Android lock screen, which consist of minimum of m keys and maximum n keys.

src/main/java/com/stevesun/solutions/ArithmeticSlices.java → src/main/java/com/fishercoder/solutions/ArithmeticSlices.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 /**A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.
 

src/main/java/com/stevesun/solutions/ArrangingCoins.java → src/main/java/com/fishercoder/solutions/ArrangingCoins.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 /**
  * You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins.

src/main/java/com/stevesun/solutions/AssignCookies.java → src/main/java/com/fishercoder/solutions/AssignCookies.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 import java.util.Arrays;
 

src/main/java/com/stevesun/solutions/BalancedBinaryTree.java → src/main/java/com/fishercoder/solutions/BalancedBinaryTree.java

@@ -1,6 +1,6 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
-import com.stevesun.common.classes.TreeNode;
+import com.fishercoder.common.classes.TreeNode;
 
 /**
  * Given a binary tree, determine if it is height-balanced.

src/main/java/com/stevesun/solutions/BeautifulArrangement.java → src/main/java/com/fishercoder/solutions/BeautifulArrangement.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 /**
  * Suppose you have N integers from 1 to N. We define a beautiful arrangement as an array that is constructed by these N numbers successfully

src/main/java/com/stevesun/solutions/BestMeetingPoint.java → src/main/java/com/fishercoder/solutions/BestMeetingPoint.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 import java.util.ArrayList;
 import java.util.Collections;

src/main/java/com/stevesun/solutions/BestTimeToBuyAndSellStockII.java → src/main/java/com/fishercoder/solutions/BestTimeToBuyAndSellStockII.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 /**Say you have an array for which the ith element is the price of a given stock on day i.
 

src/main/java/com/stevesun/solutions/BestTimeToBuyAndSellStockIII.java → src/main/java/com/fishercoder/solutions/BestTimeToBuyAndSellStockIII.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 
 /**123. Best Time to Buy and Sell Stock III

src/main/java/com/stevesun/solutions/BestTimeToBuyAndSellStockWithCooldown.java → src/main/java/com/fishercoder/solutions/BestTimeToBuyAndSellStockWithCooldown.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 /**Say you have an array for which the ith element is the price of a given stock on day i.
 

src/main/java/com/stevesun/solutions/BinaryTreeLevelOrderTraversalII.java → src/main/java/com/fishercoder/solutions/BinaryTreeLevelOrderTraversalII.java

@@ -1,6 +1,6 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
-import com.stevesun.common.classes.TreeNode;
+import com.fishercoder.common.classes.TreeNode;
 
 import java.util.*;
 

src/main/java/com/stevesun/solutions/BinaryTreeLongestConsecutiveSequence.java → src/main/java/com/fishercoder/solutions/BinaryTreeLongestConsecutiveSequence.java

@@ -1,6 +1,6 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
-import com.stevesun.common.classes.TreeNode;
+import com.fishercoder.common.classes.TreeNode;
 
 /**
  * Given a binary tree, find the length of the longest consecutive sequence path.

src/main/java/com/stevesun/solutions/BinaryTreeLongestConsecutiveSequenceII.java → src/main/java/com/fishercoder/solutions/BinaryTreeLongestConsecutiveSequenceII.java

@@ -1,6 +1,6 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
-import com.stevesun.common.classes.TreeNode;
+import com.fishercoder.common.classes.TreeNode;
 
 /**
  * Given a binary tree, you need to find the length of Longest Consecutive Path in Binary Tree.

src/main/java/com/stevesun/solutions/BinaryTreePaths.java → src/main/java/com/fishercoder/solutions/BinaryTreePaths.java

@@ -1,7 +1,7 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
-import com.stevesun.common.classes.TreeNode;
-import com.stevesun.common.utils.CommonUtils;
+import com.fishercoder.common.classes.TreeNode;
+import com.fishercoder.common.utils.CommonUtils;
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/com/stevesun/solutions/BinaryTreePostOrderTraversal.java → src/main/java/com/fishercoder/solutions/BinaryTreePostOrderTraversal.java

@@ -1,7 +1,7 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
-import com.stevesun.common.classes.TreeNode;
-import com.stevesun.common.utils.CommonUtils;
+import com.fishercoder.common.classes.TreeNode;
+import com.fishercoder.common.utils.CommonUtils;
 
 import java.util.ArrayList;
 import java.util.Collections;

src/main/java/com/stevesun/solutions/BinaryTreePreorderTraversal.java → src/main/java/com/fishercoder/solutions/BinaryTreePreorderTraversal.java

@@ -1,6 +1,6 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
-import com.stevesun.common.classes.TreeNode;
+import com.fishercoder.common.classes.TreeNode;
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/com/stevesun/solutions/BinaryTreeRightSideView.java → src/main/java/com/fishercoder/solutions/BinaryTreeRightSideView.java

@@ -1,6 +1,6 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
-import com.stevesun.common.classes.TreeNode;
+import com.fishercoder.common.classes.TreeNode;
 
 import java.util.ArrayList;
 import java.util.LinkedList;

src/main/java/com/stevesun/solutions/BinaryTreeUpsideDown.java → src/main/java/com/fishercoder/solutions/BinaryTreeUpsideDown.java

@@ -1,6 +1,6 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
-import com.stevesun.common.classes.TreeNode;
+import com.fishercoder.common.classes.TreeNode;
 
 /**
  * Given a binary tree where all the right nodes are either leaf nodes with a sibling (a left node that shares the same parent node) or empty, flip it upside down and turn it into a tree where the original right nodes turned into left leaf nodes. Return the new root.

src/main/java/com/stevesun/solutions/BinaryTreeVerticalOrderTraversal.java → src/main/java/com/fishercoder/solutions/BinaryTreeVerticalOrderTraversal.java

@@ -1,6 +1,6 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
-import com.stevesun.common.classes.TreeNode;
+import com.fishercoder.common.classes.TreeNode;
 
 import java.util.*;
 

src/main/java/com/stevesun/solutions/BombEnemies.java → src/main/java/com/fishercoder/solutions/BombEnemies.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 /**
  * Given a 2D grid, each cell is either a wall 'W', an enemy 'E' or empty '0' (the number zero), return the maximum enemies you can kill using one bomb.

src/main/java/com/stevesun/solutions/BoundaryofBinaryTree.java → src/main/java/com/fishercoder/solutions/BoundaryofBinaryTree.java

@@ -1,6 +1,6 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
-import com.stevesun.common.classes.TreeNode;
+import com.fishercoder.common.classes.TreeNode;
 
 import java.util.ArrayList;
 import java.util.HashSet;

src/main/java/com/stevesun/solutions/BrickWall.java → src/main/java/com/fishercoder/solutions/BrickWall.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 import java.util.HashMap;
 import java.util.List;

src/main/java/com/stevesun/solutions/BurstBalloons.java → src/main/java/com/fishercoder/solutions/BurstBalloons.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 /**
  * Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloons. If the you burst balloon i you will get nums[left] * nums[i] * nums[right] coins. Here left and right are adjacent indices of i. After the burst, the left and right then becomes adjacent.

src/main/java/com/stevesun/solutions/Candy.java → src/main/java/com/fishercoder/solutions/Candy.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 /**
  * There are N children standing in a line. Each child is assigned a rating value.

src/main/java/com/stevesun/solutions/ClimbingStairs.java → src/main/java/com/fishercoder/solutions/ClimbingStairs.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 /**Leetcode 70: You are climbing a stair case. It takes n steps to reach to the top.
 

src/main/java/com/stevesun/solutions/CloneGraph.java → src/main/java/com/fishercoder/solutions/CloneGraph.java

@@ -1,6 +1,6 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
-import com.stevesun.common.classes.UndirectedGraphNode;
+import com.fishercoder.common.classes.UndirectedGraphNode;
 
 import java.util.HashMap;
 import java.util.LinkedList;

src/main/java/com/stevesun/solutions/ClosestBinarySearchTreeValueII.java → src/main/java/com/fishercoder/solutions/ClosestBinarySearchTreeValueII.java

@@ -1,6 +1,6 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
-import com.stevesun.common.classes.TreeNode;
+import com.fishercoder.common.classes.TreeNode;
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/com/stevesun/solutions/CoinChange.java → src/main/java/com/fishercoder/solutions/CoinChange.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 /**
  * You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1.

src/main/java/com/stevesun/solutions/CombinationSum.java → src/main/java/com/fishercoder/solutions/CombinationSum.java

@@ -1,6 +1,6 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
-import com.stevesun.common.utils.CommonUtils;
+import com.fishercoder.common.utils.CommonUtils;
 
 import java.util.ArrayList;
 import java.util.Arrays;

src/main/java/com/stevesun/solutions/CombinationSumII.java → src/main/java/com/fishercoder/solutions/CombinationSumII.java

@@ -1,6 +1,6 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
-import com.stevesun.common.utils.CommonUtils;
+import com.fishercoder.common.utils.CommonUtils;
 
 import java.util.ArrayList;
 import java.util.Arrays;

src/main/java/com/stevesun/solutions/CombinationSumIII.java → src/main/java/com/fishercoder/solutions/CombinationSumIII.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 import java.util.*;
 

src/main/java/com/stevesun/solutions/CombinationSumIV.java → src/main/java/com/fishercoder/solutions/CombinationSumIV.java

@@ -1,6 +1,6 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
-import com.stevesun.common.utils.CommonUtils;
+import com.fishercoder.common.utils.CommonUtils;
 
 import java.util.ArrayList;
 import java.util.Arrays;

src/main/java/com/stevesun/solutions/Combinations.java → src/main/java/com/fishercoder/solutions/Combinations.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 import java.util.*;
 
 /**Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.

src/main/java/com/stevesun/solutions/ComplexNumberMultiplication.java → src/main/java/com/fishercoder/solutions/ComplexNumberMultiplication.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 /**
  * Given two strings representing two complex numbers.

src/main/java/com/stevesun/solutions/ConcatenatedWords.java → src/main/java/com/fishercoder/solutions/ConcatenatedWords.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/com/stevesun/solutions/ConstructBinaryTreefromString.java → src/main/java/com/fishercoder/solutions/ConstructBinaryTreefromString.java

@@ -1,6 +1,6 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
-import com.stevesun.common.classes.TreeNode;
+import com.fishercoder.common.classes.TreeNode;
 
 /**
  * You need to construct a binary tree from a string consisting of parenthesis and integers.

src/main/java/com/stevesun/solutions/ConstructTheRectangle.java → src/main/java/com/fishercoder/solutions/ConstructTheRectangle.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 /**
  * For a web developer, it is very important to know how to design a web page's size. So, given a specific rectangular web page’s area, your job by now is to design a rectangular web page, whose length L and width W satisfy the following requirements:
@@ -18,7 +18,7 @@
  The given area won't exceed 10,000,000 and is a positive integer
  The web page's width and length you designed must be positive integers.
 
- * Created by stevesun on 1/25/17.
+ * Created by fishercoder on 1/25/17.
  */
 public class ConstructTheRectangle {
 

src/main/java/com/stevesun/solutions/ContainerWithMostWater.java → src/main/java/com/fishercoder/solutions/ContainerWithMostWater.java

@@ -1,4 +1,4 @@
-package com.stevesun.solutions;
+package com.fishercoder.solutions;
 
 /**
  * Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.