704. Binary Search (Rust + Go improvements)

Author: maxvoronov

README.md

@@ -1,7 +1,8 @@
 # LeetCode
 
-![Problems Solved](https://img.shields.io/badge/Problems%20Solved-19%20%2F%202061-1f425f?logo=leetcode) 
+![Problems Solved](https://img.shields.io/badge/Problems%20Solved-19%20%2F%202076-1f425f?logo=leetcode) 
 ![Language: Golang](https://img.shields.io/badge/language-Golang-00ADD8?logo=go) 
+![Language: Rust](https://img.shields.io/badge/language-Rust-00ADD8?logo=rust) 
 
 ### LeetCode Algorithm
 
@@ -23,7 +24,7 @@
 | 283 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | [Go](go/0283_move_zeroes) | 🟢 |
 | 344 | [Reverse String](https://leetcode.com/problems/reverse-string/) | [Go](go/0344_reverse_string) | 🟢 |
 | 404 | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/) | [Go](go/0404_sum_of_left_leaves) | 🟢 |
-| 704 | [Binary Search](https://leetcode.com/problems/binary-search/) | [Go](go/0704_binary_search) | 🟢 |
+| 704 | [Binary Search](https://leetcode.com/problems/binary-search/) | [Go](go/0704_binary_search), [Rust](rust/_0704_binary_search) | 🟢 |
 
 ### LeetCode Shell
 

go/0704_binary_search/solution.go

@@ -1,19 +1,20 @@
 package binary_search
 
 func Search(nums []int, target int) int {
-	lowIdx, highIdx := 0, len(nums)-1
-	for lowIdx <= highIdx {
-		midIdx := (highIdx + lowIdx) / 2
-		if nums[midIdx] == target {
-			return midIdx
-		}
+    lowIdx, midIdx, highIdx := 0, 0, len(nums) - 1
 
-		if nums[midIdx] < target {
-			lowIdx = midIdx + 1
-		} else {
-			highIdx = midIdx - 1
-		}
-	}
+    for lowIdx <= highIdx {
+        midIdx = lowIdx + (highIdx - lowIdx) / 2
+        if nums[midIdx] == target {
+            return midIdx
+        }
 
-	return -1
+        if nums[midIdx] < target {
+            lowIdx = midIdx + 1
+        } else {
+            highIdx = midIdx - 1
+        }
+    }
+
+    return -1
 }

go/0704_binary_search/solution_test.go

@@ -14,6 +14,8 @@ func TestSearch(t *testing.T) {
 		{nums: []int{-1, 0, 3, 5, 9, 12}, target: 9, want: 4},
 		{nums: []int{-1, 0, 3, 5, 9, 12}, target: 2, want: -1},
 		{nums: []int{-1, 0, 3, 5, 9, 12}, target: 3, want: 2},
+		{nums: []int{5}, target: -5, want: -1},
+		{nums: []int{}, target: 3, want: -1},
 	}
 
 	for i, tc := range cases {

rust/_0704_binary_search/Cargo.toml

@@ -0,0 +1,4 @@
+[package]
+name = "_0704_binary_search"
+version = "0.1.0"
+edition = "2021"

rust/_0704_binary_search/src/lib.rs

@@ -0,0 +1,46 @@
+pub fn search(nums: Vec<i32>, target: i32) -> i32 {
+    if nums.len() > 0 {
+        let mut left = 0;
+        let mut right = (nums.len() - 1) as i32;
+        while left <= right {
+            let mid = left + (right - left) / 2;
+            let mid_idx = mid as usize;
+            if nums[mid_idx] == target {
+                return mid;
+            }
+
+            if nums[mid_idx] < target {
+                left = mid + 1;
+            } else {
+                right = mid - 1;
+            }
+        }
+    }
+
+    return -1;
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn search() {
+        struct Case {
+            nums: Vec<i32>,
+            target: i32,
+            want: i32,
+        }
+
+        let cases = vec![
+            Case { nums: vec![-1, 0, 3, 5, 9, 12], target: 9, want: 4 },
+            Case { nums: vec![-1, 0, 3, 5, 9, 12], target: 2, want: -1 },
+            Case { nums: vec![-1, 0, 3, 5, 9, 12], target: 3, want: 2 },
+            Case { nums: vec![5], target: -5, want: -1 },
+            Case { nums: vec![], target: 3, want: -1 },
+        ];
+
+        for case in cases.iter() {
+            let got = super::search(case.nums.clone(), case.target);
+            assert_eq!(case.want, got);
+        }
+    }
+}