Commit06c0af1

committed

update: 31

1 parentbef9603 commit06c0af1Copy full SHA for 06c0af1

File tree

+48

-0

lines changed

+48

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -31,6 +31,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr`
`31`	`31`	`\| 27\|[Remove Element](https://leetcode.com/problems/remove-element/)\|[JavaScript](./src/remove-element/res.js)\| Easy\|`
`32`	`32`	`\| 28\|[Implement strStr()](https://leetcode.com/problems/implement-strstr/)\|[JavaScript](./src/implement-strstr/res.js)\| Easy\|`
`33`	`33`	`\| 29\|[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)\|[JavaScript](./src/divide-two-integers/res.js)\| Medium\|`
	`34`	`+\| 31\|[next-permutation](https://leetcode.com/problems/next-permutation/)\|[TypeScript](./src/next-permutation/res.ts)\| Medium\|`
`34`	`35`	`\| 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\|`
`35`	`36`	`\| 34\|[Search for a Range](https://leetcode.com/problems/search-for-a-range/)\|[JavaScript](./src/search-for-a-range/res.js)\| Medium\|`
`36`	`37`	`\| 35\|[Search Insert Position](https://leetcode.com/problems/search-insert-position/)\|[JavaScript](./src/search-insert-position/res.js)\| Easy\|`

Lines changed: 47 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,47 @@`
	`1`	`+/**`
	`2`	`+ Do not return anything, modify nums in-place instead.`
	`3`	`+ */`
	`4`	`+functionnextPermutation(nums:number[]):void{`
	`5`	`+letcurrentPointer=nums.length-1;`
	`6`	`+letmutationCount=0;`
	`7`	`+`
	`8`	`+if(currentPointer<1){`
	`9`	`+return;`
	`10`	`+}`
	`11`	`+`
	`12`	`+while(!mutationCount\|\|currentPointer<=nums.length-1&&currentPointer>0){`
	`13`	`+mutationCount++;`
	`14`	`+if(currentPointer>0&&nums[currentPointer]>nums[currentPointer-1]){`
	`15`	`+currentPointer--;`
	`16`	`+break;`
	`17`	`+}`
	`18`	`+`
	`19`	`+currentPointer--;`
	`20`	`+}`
	`21`	`+`
	`22`	`+letswapPointer=nums.length-1;`
	`23`	`+while(swapPointer>0&&nums[swapPointer]<=nums[currentPointer]){`
	`24`	`+swapPointer--;`
	`25`	`+}`
	`26`	`+`
	`27`	`+if(!currentPointer&&!swapPointer){`
	`28`	`+nums.sort((a,b)=>a-b);`
	`29`	`+}elseif(currentPointer===nums.length-2){`
	`30`	`+constswapPointer=currentPointer+1;`
	`31`	`+constswapValue=nums[swapPointer];`
	`32`	`+nums[swapPointer]=nums[currentPointer];`
	`33`	`+nums[currentPointer]=swapValue;`
	`34`	`+}else{`
	`35`	`+// swap`
	`36`	`+constswapValue=nums[swapPointer];`
	`37`	`+nums[swapPointer]=nums[currentPointer];`
	`38`	`+nums[currentPointer]=swapValue;`
	`39`	`+`
	`40`	`+constrestList=nums.slice(currentPointer+1);`
	`41`	`+restList.sort((a,b)=>a-b);`
	`42`	`+`
	`43`	`+for(letj=currentPointer+1;j<nums.length;j++){`
	`44`	`+nums[j]=restList[j-currentPointer-1];`
	`45`	`+}`
	`46`	`+}`
	`47`	`+};`

Comments

(0)