Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commitf5cb809

Browse files
committed
update: 33 & 153 & 154
1 parent0d214bb commitf5cb809

File tree

4 files changed

+87
-0
lines changed
  • src
    • find-minimum-in-rotated-sorted-array
    • find-minimum-in-rotated-sorted-array-ii
    • search-in-rotated-sorted-array-ii

4 files changed

+87
-0
lines changed

‎README.md

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -47,6 +47,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
4747
|73|[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)|[JavaScript](./src/set-matrix-zeroes/res.js)|Medium|
4848
|75|[Sort Colors](https://leetcode.com/problems/sort-colors/)|[JavaScript](./src/sort-colors/res.js)|Medium|
4949
|80|[Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)|[JavaScript](./src/remove-duplicates-from-sorted-array-ii/res.js)|Medium|
50+
|81|[Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/)|[JavaScript](./src/search-in-rotated-sorted-array-ii/res.js)|Medium|
5051
|88|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)|[JavaScript](./src/merge-sorted-array/res.js)|Medium|
5152
|91|[Decode Ways](https://leetcode.com/problems/decode-ways/)|[JavaScript](./src/decode-ways/res.js)|Medium|
5253
|93|[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/)|[JavaScript](./src/restore-ip-addresses/res.js)|Medium|
@@ -64,6 +65,8 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
6465
|137|[Single Number II](https://leetcode.com/problems/single-number-ii/)|[JavaScript](./src/single-number-ii/res.js)|Medium|
6566
|151|[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/)|[JavaScript](./src/reverse-words-in-a-string/res.js)|Medium|
6667
|152|[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)|[JavaScript](./src/maximum-product-subarray/res.js)|Medium|
68+
|153|[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)|[JavaScript](./src/find-minimum-in-rotated-sorted-array/res.js)|Medium|
69+
|154|[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/)|[JavaScript](./src/find-minimum-in-rotated-sorted-array-ii/res.js)|Medium|
6770
|164|[Maximum Gap](https://leetcode.com/problems/maximum-gap/)|[JavaScript](./src/maximum-gap/res.js)|Hard|
6871
|165|[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/)|[JavaScript](./src/compare-version-numbers/res.js)|Medium|
6972
|175|[Combine Two Tables](https://leetcode.com/problems/combine-two-tables/)|[SQL](./src/combine-two-tables/res.txt)|Easy|
Lines changed: 22 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
/**
2+
*@param {number[]} nums
3+
*@return {number}
4+
*/
5+
varfindMin=function(nums){
6+
constlen=nums.length;
7+
letleft=0,right=len-1;
8+
9+
while(left<right){
10+
constmid=(left+right)>>1;
11+
12+
if(nums[mid]>nums[right]){
13+
left=mid+1;
14+
}elseif(nums[mid]<nums[right]){
15+
right=mid;
16+
}else{
17+
right-=1;
18+
}
19+
}
20+
21+
returnnums[left];
22+
};
Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
/**
2+
*@param {number[]} nums
3+
*@return {number}
4+
*/
5+
varfindMin=function(nums){
6+
constlen=nums.length;
7+
letleft=0,right=len-1;
8+
if(len===1||nums[left]<nums[right])returnnums[0];
9+
10+
while(left<right){
11+
constmid=(left+right)>>1;
12+
13+
if(nums[left]>nums[mid]||nums[mid]<nums[right]){
14+
right=mid;
15+
}elseif(nums[left]<nums[mid]||nums[mid]>nums[right]){
16+
left=mid+1;
17+
}
18+
}
19+
20+
returnnums[left];
21+
};
Lines changed: 41 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,41 @@
1+
/**
2+
*@param {number[]} nums
3+
*@param {number} target
4+
*@return {boolean}
5+
*/
6+
varsearch=function(nums,target){
7+
constlen=nums.length;
8+
9+
if(nums[0]===nums[len-1]){
10+
if(nums[0]===target)returntrue;
11+
else{
12+
letindex=false;
13+
nums.map((e,i)=>{
14+
if(e===target)index=i;
15+
});
16+
if(index)returntrue;
17+
}
18+
}else{
19+
returnsubsearch(nums,target);
20+
}
21+
22+
returnfalse;
23+
};
24+
25+
constsubsearch=(nums,target)=>{
26+
letlo=0,hi=nums.length-1;
27+
28+
while(lo<hi){
29+
letmid=(lo+hi)>>1;
30+
31+
if(nums[0]<=nums[mid]&&(target>nums[mid]||target<nums[0])){
32+
lo=mid+1;
33+
}elseif(target<nums[0]&&target>nums[mid]){
34+
lo=mid+1;
35+
}else{
36+
hi=mid;
37+
}
38+
}
39+
40+
returnlo==hi&&nums[lo]==target;
41+
}

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp