Commit 5f8273e

committed

feat: add solutions to lc problem: No.0704.Binary Search

1 parent 17fb135 commit 5f8273eCopy full SHA for 5f8273e

File tree

+76

-18

lines changed

+76

-18

lines changed

Lines changed: 27 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -85,13 +85,11 @@ class Solution {`
`85`	`85`	`public:`
`86`	`86`	`int search(vector<int>& nums, int target) {`
`87`	`87`	`int left = 0, right = nums.size() - 1;`
`88`		`- while (left < right) {`
	`88`	`+ while (left < right)`
	`89`	`+ {`
`89`	`90`	`int mid = left + right >> 1;`
`90`		`- if (nums[mid] >= target) {`
`91`		`- right = mid;`
`92`		`- } else {`
`93`		`- left = mid + 1;`
`94`		`- }`
	`91`	`+ if (nums[mid] >= target) right = mid;`
	`92`	`+ else left = mid + 1;`
`95`	`93`	`}`
`96`	`94`	`return nums[left] == target ? left : -1;`
`97`	`95`	`}`
`@@ -118,6 +116,29 @@ func search(nums []int, target int) int {`
`118`	`116`	`}`
`119`	`117`	```
`120`	`118`
	`119`	`+### JavaScript`
	`120`	`+`
	`121`	+```js
	`122`	`+/**`
	`123`	`+ * @param {number[]} nums`
	`124`	`+ * @param {number} target`
	`125`	`+ * @return {number}`
	`126`	`+ */`
	`127`	`+ var search = function(nums, target) {`
	`128`	`+ let left = 0;`
	`129`	`+ let right = nums.length - 1;`
	`130`	`+ while (left < right) {`
	`131`	`+ const mid = (left + right) >> 1;`
	`132`	`+ if (nums[mid] >= target) {`
	`133`	`+ right = mid;`
	`134`	`+ } else {`
	`135`	`+ left = mid + 1;`
	`136`	`+ }`
	`137`	`+ }`
	`138`	`+ return nums[left] == target ? left : -1;`
	`139`	`+};`
	`140`	+```
	`141`	`+`
`121`	`142`	`### ...`
`122`	`143`
`123`	`144`	```

Lines changed: 27 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -79,13 +79,11 @@ class Solution {`
`79`	`79`	`public:`
`80`	`80`	`int search(vector<int>& nums, int target) {`
`81`	`81`	`int left = 0, right = nums.size() - 1;`
`82`		`- while (left < right) {`
	`82`	`+ while (left < right)`
	`83`	`+ {`
`83`	`84`	`int mid = left + right >> 1;`
`84`		`- if (nums[mid] >= target) {`
`85`		`- right = mid;`
`86`		`- } else {`
`87`		`- left = mid + 1;`
`88`		`- }`
	`85`	`+ if (nums[mid] >= target) right = mid;`
	`86`	`+ else left = mid + 1;`
`89`	`87`	`}`
`90`	`88`	`return nums[left] == target ? left : -1;`
`91`	`89`	`}`
`@@ -112,6 +110,29 @@ func search(nums []int, target int) int {`
`112`	`110`	`}`
`113`	`111`	```
`114`	`112`
	`113`	`+### JavaScript`
	`114`	`+`
	`115`	+```js
	`116`	`+/**`
	`117`	`+ * @param {number[]} nums`
	`118`	`+ * @param {number} target`
	`119`	`+ * @return {number}`
	`120`	`+ */`
	`121`	`+ var search = function(nums, target) {`
	`122`	`+ let left = 0;`
	`123`	`+ let right = nums.length - 1;`
	`124`	`+ while (left < right) {`
	`125`	`+ const mid = (left + right) >> 1;`
	`126`	`+ if (nums[mid] >= target) {`
	`127`	`+ right = mid;`
	`128`	`+ } else {`
	`129`	`+ left = mid + 1;`
	`130`	`+ }`
	`131`	`+ }`
	`132`	`+ return nums[left] == target ? left : -1;`
	`133`	`+};`
	`134`	+```
	`135`	`+`
`115`	`136`	`### ...`
`116`	`137`
`117`	`138`	```

Lines changed: 4 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,13 +2,11 @@ class Solution {`
`2`	`2`	`public:`
`3`	`3`	`int search(vector<int>& nums, int target) {`
`4`	`4`	`int left = 0, right = nums.size() - 1;`
`5`		`- while (left < right) {`
	`5`	`+ while (left < right)`
	`6`	`+ {`
`6`	`7`	`int mid = left + right >> 1;`
`7`		`- if (nums[mid] >= target) {`
`8`		`- right = mid;`
`9`		`- } else {`
`10`		`- left = mid + 1;`
`11`		`- }`
	`8`	`+ if (nums[mid] >= target) right = mid;`
	`9`	`+ else left = mid + 1;`
`12`	`10`	`}`
`13`	`11`	`return nums[left] == target ? left : -1;`
`14`	`12`	`}`

Lines changed: 18 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,18 @@`
	`1`	`+/**`
	`2`	`+ * @param {number[]} nums`
	`3`	`+ * @param {number} target`
	`4`	`+ * @return {number}`
	`5`	`+ */`
	`6`	`+ var search = function(nums, target) {`
	`7`	`+ let left = 0;`
	`8`	`+ let right = nums.length - 1;`
	`9`	`+ while (left < right) {`
	`10`	`+ const mid = (left + right) >> 1;`
	`11`	`+ if (nums[mid] >= target) {`
	`12`	`+ right = mid;`
	`13`	`+ } else {`
	`14`	`+ left = mid + 1;`
	`15`	`+ }`
	`16`	`+ }`
	`17`	`+ return nums[left] == target ? left : -1;`
	`18`	`+};`

Comments

(0)