feat: add python and java solutions to leetcode problem: No.0278

Author: yanglbme

solution/0200-0299/0278.First Bad Version/README.md

@@ -25,22 +25,93 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+二分查找。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+# The isBadVersion API is already defined for you.
+# @param version, an integer
+# @return an integer
+# def isBadVersion(version):
+
+class Solution:
+    def firstBadVersion(self, n):
+        """
+        :type n: int
+        :rtype: int
+        """
+        low, high = 1, n
+        while low < high:
+            mid = low + ((high - low) >> 1)
+            if isBadVersion(mid):
+                high = mid
+            else:
+                low = mid + 1
+        return low
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+/* 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 low = 1, high = n;
+        while (low < high) {
+            int mid = low + ((high - low) >> 1);
+            if (isBadVersion(mid)) high = mid;
+            else low = mid + 1;
+        }
+        return low;
+    }
+}
+```
 
+### **JavaScript**
+
+```js
+/**
+ * Definition for isBadVersion()
+ *
+ * @param {integer} version number
+ * @return {boolean} whether the version is bad
+ * isBadVersion = function(version) {
+ *     ...
+ * };
+ */
+
+/**
+ * @param {function} isBadVersion()
+ * @return {function}
+ */
+var solution = function (isBadVersion) {
+  /**
+   * @param {integer} n Total versions
+   * @return {integer} The first bad version
+   */
+  return function (n) {
+    let low = 1,
+      high = n;
+    while (low < high) {
+      const mid = low + ((high - low) >> 1);
+      if (isBadVersion(mid)) {
+        high = mid;
+      } else {
+        low = mid + 1;
+      }
+    }
+    return low;
+  };
+};
 ```
 
 ### **...**

solution/0200-0299/0278.First Bad Version/README_EN.md

@@ -37,13 +37,82 @@ Then 4 is the first bad version.&nbsp;</code>
 ### **Python3**
 
 ```python
-
+# The isBadVersion API is already defined for you.
+# @param version, an integer
+# @return an integer
+# def isBadVersion(version):
+
+class Solution:
+    def firstBadVersion(self, n):
+        """
+        :type n: int
+        :rtype: int
+        """
+        low, high = 1, n
+        while low < high:
+            mid = low + ((high - low) >> 1)
+            if isBadVersion(mid):
+                high = mid
+            else:
+                low = mid + 1
+        return low
 ```
 
 ### **Java**
 
 ```java
+/* 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 low = 1, high = n;
+        while (low < high) {
+            int mid = low + ((high - low) >> 1);
+            if (isBadVersion(mid)) high = mid;
+            else low = mid + 1;
+        }
+        return low;
+    }
+}
+```
 
+### **JavaScript**
+
+```js
+/**
+ * Definition for isBadVersion()
+ *
+ * @param {integer} version number
+ * @return {boolean} whether the version is bad
+ * isBadVersion = function(version) {
+ *     ...
+ * };
+ */
+
+/**
+ * @param {function} isBadVersion()
+ * @return {function}
+ */
+var solution = function (isBadVersion) {
+  /**
+   * @param {integer} n Total versions
+   * @return {integer} The first bad version
+   */
+  return function (n) {
+    let low = 1,
+      high = n;
+    while (low < high) {
+      const mid = low + ((high - low) >> 1);
+      if (isBadVersion(mid)) {
+        high = mid;
+      } else {
+        low = mid + 1;
+      }
+    }
+    return low;
+  };
+};
 ```
 
 ### **...**

solution/0200-0299/0278.First Bad Version/Solution.java

@@ -3,15 +3,12 @@
 
 public class Solution extends VersionControl {
     public int firstBadVersion(int n) {
-		int low = 1, high = n;
-		while (low < high) {
-			int mid = low + (high - low) / 2;
-			if (isBadVersion(mid)) {
-				high = mid;
-			} else {
-				low = mid + 1;
-			}
-		}
-		return low;    
+        int low = 1, high = n;
+        while (low < high) {
+            int mid = low + ((high - low) >> 1);
+            if (isBadVersion(mid)) high = mid;
+            else low = mid + 1;
+        }
+        return low;
     }
 }

solution/0200-0299/0278.First Bad Version/Solution.js

@@ -1,6 +1,6 @@
 /**
  * Definition for isBadVersion()
- *
+ * 
  * @param {integer} version number
  * @return {boolean} whether the version is bad
  * isBadVersion = function(version) {
@@ -12,24 +12,21 @@
  * @param {function} isBadVersion()
  * @return {function}
  */
-const solution = function (isBadVersion) {
+var solution = function(isBadVersion) {
   /**
    * @param {integer} n Total versions
    * @return {integer} The first bad version
    */
-  return function (n) {
-    if (n === 1) return n;
-    let left = 1,
-      right = n;
-    while (left < right) {
-      let mid = left + Math.floor((right - left) / 2);
-      if (isBadVersion(mid)) {
-        if (mid === left) return mid;
-        else right = mid;
-      } else {
-        if (isBadVersion(mid + 1)) return mid + 1;
-        else left = mid + 1;
+  return function(n) {
+      let low = 1, high = n;
+      while (low < high) {
+          const mid = low + ((high - low) >> 1);
+          if (isBadVersion(mid)) {
+              high = mid;
+          } else {
+              low = mid + 1;
+          }
       }
-    }
+      return low;
   };
-};
+};

solution/0200-0299/0278.First Bad Version/Solution.py

@@ -0,0 +1,19 @@
+# The isBadVersion API is already defined for you.
+# @param version, an integer
+# @return an integer
+# def isBadVersion(version):
+
+class Solution:
+    def firstBadVersion(self, n):
+        """
+        :type n: int
+        :rtype: int
+        """
+        low, high = 1, n
+        while low < high:
+            mid = low + ((high - low) >> 1)
+            if isBadVersion(mid):
+                high = mid
+            else:
+                low = mid + 1
+        return low