add biset and next inorder bst

Author: tg123

first-bad-version/README.md

@@ -0,0 +1,23 @@
+/* The isBadVersion API is defined in the parent class VersionControl.
+      boolean isBadVersion(int version); */
+
+public class Solution extends VersionControl {
+    public int firstBadVersion(int n) {
+        int good = 0; // not exists
+        int bad  = n;
+
+        for(;;) {
+
+            if(bad - good <= 1) return bad;
+
+            int t = (bad - good) / 2 + good; // fuck overflow
+
+            if(isBadVersion(t)){
+                bad  = t;
+            } else {
+                good = t;
+            }
+        }
+
+    }
+}

first-bad-version/Solution.java

@@ -0,0 +1,7 @@
+---
+layout: solution
+title: First Bad Version
+date: 2015-09-24 16:10:45+08:00
+leetcode_id: 278
+---
+{% include_relative README.md %}

first-bad-version/index.md

@@ -0,0 +1,35 @@
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode(int x) { val = x; }
+ * }
+ */
+public class Solution {
+
+    TreeNode leftMost(TreeNode root){
+        if(root == null) return null;
+        if(root.left != null) return leftMost(root.left);
+        return root;
+    }
+
+    public TreeNode inorderSuccessor(TreeNode root, TreeNode p) {
+        if(root == p) {
+            return leftMost(p.right);
+        }
+
+        if(p.val < root.val) {
+            p = inorderSuccessor(root.left, p);
+
+            if(p == null){
+                return root;
+            }
+
+            return p;
+        }
+
+        return inorderSuccessor(root.right, p);
+    }
+}

inorder-successor-in-bst/README.md

@@ -0,0 +1,7 @@
+---
+layout: solution
+title: Inorder Successor in BST
+date: 2015-09-24 17:32:03+08:00
+leetcode_id: 285
+---
+{% include_relative README.md %}