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

Commit67e574e

Browse files
committed
update: 41
1 parentf5cdb14 commit67e574e

File tree

3 files changed

+89
-2
lines changed

3 files changed

+89
-2
lines changed

‎README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -28,6 +28,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
2828
|29|[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)|[JavaScript](./src/divide-two-integers/res.js)|Medium|
2929
|33|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)|[JavaScript](./src/search-in-rotated-sorted-array/res.js)|Medium|
3030
|34|[Search for a Range](https://leetcode.com/problems/search-for-a-range/)|[JavaScript](./src/search-for-a-range/res.js)|Medium|
31+
|41|[First Missing Positive](https://leetcode.com/problems/first-missing-positive/description/)|[JavaScript](./src/first-missing-positive/res.js)|Hard|
3132
|43|[Multiply Strings](https://leetcode.com/problems/multiply-strings/)|[JavaScript](./src/multiply-strings/res.js)|Medium|
3233
|46|[Permutations](https://leetcode.com/problems/permutations/)|[JavaScript](./src/permutations/res.js)|Medium|
3334
|48|[Rotate Image](https://leetcode.com/problems/rotate-image/)|[JavaScript](./src/rotate-image/res.js)|Medium|

‎src/first-missing-positive/res.js

Lines changed: 23 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,23 @@
1+
/**
2+
*@param {number[]} nums
3+
*@return {number}
4+
*/
5+
varfirstMissingPositive=function(nums){
6+
constarrLen=nums.length;
7+
constnewArray=newArray(arrLen);
8+
9+
for(letindex=0;index<arrLen;index++){
10+
constelement=nums[index];
11+
12+
if(element>0&&element<=arrLen){
13+
(newArray[element-1]>0 ?newArray[element-1]+=1 :newArray[element-1]=1);
14+
}
15+
}
16+
17+
leti=0;
18+
while(newArray[i]&&i<arrLen){
19+
i++;
20+
};
21+
22+
returni+1;
23+
};

‎src/rotate-array/res.js

Lines changed: 65 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -17,10 +17,73 @@
1717
*@param {number} k
1818
*@return {void} Do not return anything, modify nums in-place instead.
1919
*/
20-
varrotate=function(nums,k){
20+
constrotate=function(nums,k){
2121
letnumslen=nums.length;
2222
for(leti=0;i<k;i++){
2323
letlastnode=nums.pop();
2424
nums.unshift(lastnode);
2525
}
26-
};
26+
};
27+
28+
/**
29+
* 2
30+
*@param {*} nums
31+
*@param {*} k
32+
*/
33+
constrotate_2=(nums,k)=>{
34+
lettemp,previous;
35+
for(leti=0;i<k;i++){
36+
previous=nums[nums.length-1];
37+
for(letj=0;j<nums.length;j++){
38+
temp=nums[j];
39+
nums[j]=previous;
40+
previous=temp;
41+
}
42+
}
43+
}
44+
45+
/**
46+
* 3
47+
*@param {*} nums
48+
*@param {*} k
49+
*/
50+
constrotate_3=(nums,k)=>{
51+
letcount=0;
52+
53+
for(letstart=0;count<nums.length;start++){
54+
letcurIndex=start;
55+
letprevNum=nums[start];
56+
57+
do{
58+
constnextIndex=(curIndex+k)%nums.length;
59+
lettemp=nums[nextIndex];
60+
nums[nextIndex]=prevNum;
61+
prevNum=temp;
62+
curIndex=nextIndex;
63+
count++;
64+
}while(start!==curIndex);
65+
}
66+
}
67+
68+
/**
69+
* 4
70+
*@param {*} nums
71+
*@param {*} k
72+
*/
73+
constrotate_4=(nums,k)=>{
74+
k%=nums.length;
75+
reverse(nums,0,nums.length-1);
76+
reverse(nums,0,k-1);
77+
reverse(nums,k,nums.length-1);
78+
}
79+
80+
constreverse=(nums,start,end)=>{
81+
while(start<end){
82+
consttemp=nums[start];
83+
nums[start]=nums[end];
84+
nums[end]=temp;
85+
86+
end-=1;
87+
start+=1;
88+
}
89+
}

0 commit comments

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