0704: Binary Search

golevy · golevy · commit 89e86595e172 · 2024-05-06T23:45:40.000+08:00
diff --git a/0704-Binary_Search/readme.md b/0704-Binary_Search/readme.md
@@ -1,3 +1,5 @@
+# 704. Binary Search
+
 Given an array of integers `nums` which is sorted in ascending order, and an integer `target`, write a function to search `target` in `nums`. If `target` exists, then return its index. Otherwise, return `-1`.
 
 You must write an algorithm with `O(log n)` runtime complexity.

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,5 @@`
	`1`	`+# 704. Binary Search`
	`2`	`+`
`1`	`3`	Given an array of integers `nums` which is sorted in ascending order, and an integer `target`, write a function to search `target` in `nums`. If `target` exists, then return its index. Otherwise, return `-1`.
`2`	`4`
`3`	`5`	You must write an algorithm with `O(log n)` runtime complexity.