fd

Author: dingjikerbo

solution/src/main/java/com/inuker/solution/FlattenBinaryTreeToLinkedList.java

@@ -44,18 +44,14 @@ public TreeNode helper(TreeNode root) {
         if (root == null) {
             return null;
         }
-        if (root.left == null && root.right == null) {
-            return root;
-        }
-
         TreeNode right = root.right;
         TreeNode leftTail = null, rightTail = null;
 
         if (root.left != null) {
             leftTail = helper(root.left);
             root.right = root.left;
-            leftTail.right = right;
             root.left = null;
+            leftTail.right = right;
         }
 
         rightTail = helper(right);

solution/src/main/java/com/inuker/solution/RandomizedSet.java renamed to solution/src/main/java/com/inuker/solution/InsertDeleteGetRandom.java

@@ -14,13 +14,13 @@
  * remove时要判断删除的是不是最后一个，另外交换了结尾后要更新结尾数的idx
  */
 // 耗时111ms
-public class RandomizedSet {
+public class InsertDeleteGetRandom {
 
     private HashMap<Integer, Integer> mMap;
     private List<Integer> mList;
     private Random mRandom;
 
-    public RandomizedSet() {
+    public InsertDeleteGetRandom() {
         mList = new ArrayList<Integer>();
         mMap = new HashMap<Integer, Integer>();
         mRandom = new Random();

solution/src/main/java/com/inuker/solution/RandomizedCollection.java renamed to solution/src/main/java/com/inuker/solution/InsertDeleteGetRandomII.java

@@ -14,14 +14,14 @@
 /**
  * 这题的区别在于允许数字重复，那么保存index需要用set，删除的时候从set中随便删一个就行了
  */
-public class RandomizedCollection {
+public class InsertDeleteGetRandomII {
 
     private HashMap<Integer, HashSet<Integer>> map;
     private List<Integer> list = new ArrayList<Integer>();
     private Random random;
 
     /** Initialize your data structure here. */
-    public RandomizedCollection () {
+    public InsertDeleteGetRandomII() {
         map = new HashMap<Integer, HashSet<Integer>>();
         list = new Vector<Integer>();
         random = new Random();

test/src/main/java/com/inuker/test/Test2.java

@@ -21,38 +21,5 @@
  */
 
 public class Test2 {
-    /**
-     * TestCase
-     * [3,1,1], 3
-     */
-    public int search(int[] nums, int target) {
-        int left = 0, right = nums.length - 1;
-
-        while (left <= right) {
-            int mid = (left + right) / 2;
-
-            if (target == nums[mid]) {
-                return mid;
-            }
-
-            if (nums[mid] > nums[left]) {
-                if (target >= nums[left] && target < nums[mid]) {
-                    right = mid - 1;
-                } else {
-                    left = mid + 1;
-                }
-            } else if (nums[mid] == nums[left]) {
-                left++;
-            } else {
-                if (target > nums[mid] && target <= nums[right]) {
-                    left = mid + 1;
-                } else {
-                    right = mid - 1;
-                }
-            }
-        }
-
-        return -1;
-    }
 
 }