array

Author: vegetabledogg

278-First-Bad-Version.cpp

@@ -0,0 +1,23 @@
+/*
+ * 注意median如果用(begin + end) / 2的话，begin + end可能会溢出
+ */
+// Forward declaration of isBadVersion API.
+bool isBadVersion(int version);
+
+class Solution {
+public:
+    int firstBadVersion(int n) {
+        int begin = 1, end = n, median;
+        while(begin < end){
+            median = begin + (end - begin) / 2;
+            if(isBadVersion(median) == true){
+                end = median;
+            }
+            else{
+                begin = median + 1;
+            }
+        }
+        return begin;
+    }
+};
+

35-Search-Insert-Position.cpp

@@ -0,0 +1,22 @@
+class Solution {
+public:
+    int searchInsert(vector<int>& nums, int target) {
+        int begin = 0, end = nums.size() - 1, median;
+        while(1){
+			if(end < begin){
+				return begin;
+			}
+            median = (begin + end) / 2;
+            if(nums[median] > target){
+                end = median - 1;
+            }
+            else if(nums[median] < target){
+                begin = median + 1;
+            }
+            else{
+                return median;
+            }
+        }
+    }
+};
+