fd

Author: dingjikerbo

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

@@ -9,6 +9,7 @@
 
 /**
  * Created by dingjikerbo on 16/11/21.
+ * https://leetcode.com/articles/merge-intervals/
  */
 
 public class MergeIntervals {

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

@@ -10,7 +10,7 @@ public class PeekingIterator implements Iterator<Integer> {
 
     private Iterator<Integer> mIterator;
 
-    private Integer mPeek;
+    private Integer mNext;
 
     public PeekingIterator(Iterator<Integer> iterator) {
         // initialize any member here.
@@ -19,30 +19,27 @@ public PeekingIterator(Iterator<Integer> iterator) {
 
     // Returns the next element in the iteration without advancing the iterator.
     public Integer peek() {
-        if (mPeek == null) {
-            if (mIterator.hasNext()) {
-                mPeek = mIterator.next();
-            }
+        if (mNext != null) {
+            return mNext;
         }
-        return mPeek;
+        mNext = mIterator.next();
+        return mNext;
     }
 
     // hasNext() and next() should behave the same as in the Iterator interface.
     // Override them if needed.
     @Override
     public Integer next() {
-        if (mPeek == null) {
-            if (mIterator.hasNext()) {
-                mPeek = mIterator.next();
-            }
+        if (mNext != null) {
+            Integer ret = mNext;
+            mNext = null;
+            return ret;
         }
-        Integer res = mPeek;
-        mPeek = null;
-        return res;
+        return mIterator.next();
     }
 
     @Override
     public boolean hasNext() {
-        return mPeek != null || mIterator.hasNext();
+        return mNext != null || mIterator.hasNext();
     }
 }

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

@@ -3,82 +3,57 @@
 import com.inuker.solution.BinaryTreeInorderTraversal;
 import com.inuker.solution.ClosestBinarySearchTreeValueII;
 import com.inuker.solution.InorderSuccessorInBST;
+import com.leetcode.library.Interval;
 import com.leetcode.library.TreeNode;
 
 import java.util.ArrayList;
+import java.util.Collections;
+import java.util.Comparator;
+import java.util.Iterator;
 import java.util.LinkedList;
 import java.util.List;
 import java.util.Stack;
 
 public class main {
 
     public static void main(String[] args) {
-        TreeNode root = TreeNode.buildTree(new Integer[]{
-                2, 1
-        });
-
-        List<Integer> list = closestKValues(root, 4.14, 2);
-        for (Integer n : list) {
-            System.out.print(n + " ");
-        }
     }
 
-    int mMaxCount;
-    int mCurVal;
-    int mCurCount;
-    int mMaxElemSize;
+    class PeekingIterator implements Iterator<Integer> {
 
-    int idx;
+        private Integer mNext;
 
-    public int[] findMode(TreeNode root) {
-        helper(root);
-        int[] result = new int[mMaxElemSize];
-        mCurCount = 0;
-        unite(root, result);
-        return result;
-    }
+        private Iterator<Integer> mIterator;
 
-    private void unite(TreeNode node, int[] result) {
-        if (node == null) {
-            return;
+        public PeekingIterator(Iterator<Integer> iterator) {
+            // initialize any member here.
+            mIterator = iterator;
         }
-        unite(node.left, result);
 
-        if (node.val == mCurVal) {
-            mCurCount++;
-        } else {
-            mCurCount = 1;
-            mCurVal = node.val;
+        // Returns the next element in the iteration without advancing the iterator.
+        public Integer peek() {
+            if (mNext != null) {
+                return mNext;
+            }
+            mNext = mIterator.next();
+            return mNext;
         }
 
-        if (mCurCount == mMaxCount) {
-            result[idx++] = mCurVal;
+        // hasNext() and next() should behave the same as in the Iterator interface.
+        // Override them if needed.
+        @Override
+        public Integer next() {
+            if (mNext != null) {
+                Integer ret = mNext;
+                mNext = null;
+                return ret;
+            }
+            return mIterator.next();
         }
 
-        unite(node.right, result);
-    }
-
-    private void helper(TreeNode node) {
-        if (node == null) {
-            return;
+        @Override
+        public boolean hasNext() {
+            return mNext != null || mIterator.hasNext();
         }
-
-        helper(node.left);
-
-        if (node.val == mCurVal) {
-            mCurCount++;
-        } else {
-            mCurCount = 1;
-            mCurVal = node.val;
-        }
-
-        if (mCurCount == mMaxCount) {
-            mMaxElemSize++;
-        } else if (mCurCount > mMaxCount) {
-            mMaxElemSize = 1;
-            mMaxCount = mCurCount;
-        }
-
-        helper(node.right);
     }
 }