Skip to content

feat: add ts solution to lc problem: No.0035 #3194

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 11 commits into from
Jul 3, 2024
Merged

feat: add ts solution to lc problem: No.0035 #3194

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
11 commits
Select commit Hold shift + click to select a range
17f77d5
feat: add ts solution to lc problem: No.0035
rain84 Jul 2, 2024
2aa9c4a
Update README.md
yanglbme Jul 3, 2024
e3510c9
Update README_EN.md
yanglbme Jul 3, 2024
a9ba6b6
Update Solution.ts
yanglbme Jul 3, 2024
8063653
Update Solution.py
yanglbme Jul 3, 2024
2587290
Update Solution.java
yanglbme Jul 3, 2024
6badead
Update Solution.cpp
yanglbme Jul 3, 2024
8dad9de
Update Solution.go
yanglbme Jul 3, 2024
94ddcbd
Update Solution.js
yanglbme Jul 3, 2024
3fa6885
Update Solution.rs
yanglbme Jul 3, 2024
fff13ff
Update Solution.php
yanglbme Jul 3, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
156 changes: 84 additions & 72 deletions solution/0000-0099/0035.Search Insert Position/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -74,31 +74,31 @@ tags:
```python
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
left, right = 0, len(nums)
while left < right:
mid = (left + right) >> 1
l, r = 0, len(nums)
while l < r:
mid = (l + r) >> 1
if nums[mid] >= target:
right = mid
r = mid
else:
left = mid + 1
return left
l = mid + 1
return l
```

#### Java

```java
class Solution {
public int searchInsert(int[] nums, int target) {
int left = 0, right = nums.length;
while (left < right) {
int mid = (left + right) >>> 1;
int l = 0, r = nums.length;
while (l < r) {
int mid = (l + r) >>> 1;
if (nums[mid] >= target) {
right = mid;
r = mid;
} else {
left = mid + 1;
l = mid + 1;
}
}
return left;
return l;
}
}
```
Expand All @@ -109,15 +109,16 @@ class Solution {
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int left = 0, right = nums.size();
while (left < right) {
int mid = left + right >> 1;
if (nums[mid] >= target)
right = mid;
else
left = mid + 1;
int l = 0, r = nums.size();
while (l < r) {
int mid = (l + r) >> 1;
if (nums[mid] >= target) {
r = mid;
} else {
l = mid + 1;
}
}
return left;
return l;
}
};
```
Expand All @@ -126,42 +127,52 @@ public:

```go
func searchInsert(nums []int, target int) int {
left, right := 0, len(nums)
for left < right {
mid := (left + right) >> 1
l, r := 0, len(nums)
for l < r {
mid := (l + r) >> 1
if nums[mid] >= target {
right = mid
r = mid
} else {
left = mid + 1
l = mid + 1
}
}
return left
return l
}
```

#### TypeScript

```ts
function searchInsert(nums: number[], target: number): number {
let [l, r] = [0, nums.length];
while (l < r) {
const mid = (l + r) >> 1;
if (nums[mid] >= target) {
r = mid;
} else {
l = mid + 1;
}
}
return l;
}
```

#### Rust

```rust
use std::cmp::Ordering;
impl Solution {
pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
let mut left = 0;
let mut right = nums.len();
while left < right {
let mid = left + (right - left) / 2;
match nums[mid].cmp(&target) {
Ordering::Less => {
left = mid + 1;
}
Ordering::Greater => {
right = mid;
}
Ordering::Equal => {
return mid as i32;
}
let mut l: usize = 0;
let mut r: usize = nums.len();
while l < r {
let mid = (l + r) >> 1;
if nums[mid] >= target {
r = mid;
} else {
l = mid + 1;
}
}
left as i32
l as i32
}
}
```
Expand All @@ -175,20 +186,44 @@ impl Solution {
* @return {number}
*/
var searchInsert = function (nums, target) {
let left = 0;
let right = nums.length;
while (left < right) {
const mid = (left + right) >> 1;
let [l, r] = [0, nums.length];
while (l < r) {
const mid = (l + r) >> 1;
if (nums[mid] >= target) {
right = mid;
r = mid;
} else {
left = mid + 1;
l = mid + 1;
}
}
return left;
return l;
};
```

#### PHP

```php
class Solution {
/**
* @param Integer[] $nums
* @param Integer $target
* @return Integer
*/
function searchInsert($nums, $target) {
$l = 0;
$r = count($nums);
while ($l < $r) {
$mid = $l + $r >> 1;
if ($nums[$mid] >= $target) {
$r = $mid;
} else {
$l = $mid + 1;
}
}
return $l;
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down Expand Up @@ -241,29 +276,6 @@ func searchInsert(nums []int, target int) int {
}
```

#### PHP

```php
class Solution {
/**
* @param integer[] $nums
* @param integer $target
* @return integer
*/

function searchInsert($nums, $target) {
$key = array_search($target, $nums);
if ($key !== false) {
return $key;
}

$nums[] = $target;
sort($nums);
return array_search($target, $nums);
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
Loading
Loading