Commite98858b

zongyanqi

committed

add solution comments to 041

1 parentfbc33dd commite98858bCopy full SHA for e98858b

File tree

+16

-3

lines changed

+16

-3

lines changed

Lines changed: 16 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -10,20 +10,33 @@`
`10`	`10`	`*/`
`11`	`11`
`12`	`12`	`/**`
	`13`	`+ * 思路介绍`
	`14`	`+ * 1. 将第 i 个元素放到第 i 个坑`
	`15`	`+ * 2. 遍历所有的坑, 找到数字不对应的坑`
	`16`	`+ *`
	`17`	`+ * 例如`
	`18`	`+ * [ 3, 4, -1, 1 ]`
	`19`	`+ * --> [ -1, 4, 3, 1 ]`
	`20`	`+ * --> [ -1, 1, 3, 4 ]`
	`21`	`+ * --> [ 1, -1, 3, 4 ]`
	`22`	`+ * --> 2`
	`23`	`+ *`
`13`	`24`	`*@param {number[]} nums`
`14`	`25`	`*@return {number}`
`15`	`26`	`*/`
`16`	`27`	`varfirstMissingPositive=function(nums){`
`17`	`28`	`varn=nums.length;`
`18`	`29`	`vari=0;`
	`30`	`+// console.log(nums);`
`19`	`31`	`while(i<n){`
`20`	`32`	`varc=nums[i];`
`21`	`33`	`if(c>0&&n<n+1&&c!==i+1&&nums[c-1]!==nums[i]){`
`22`	`34`	`swap(nums,c-1,i);`
`23`		`-//i--;`
	`35`	`+//console.log('-->', nums);`
`24`	`36`	`}else{`
`25`	`37`	`i++;`
`26`	`38`	`}`
	`39`	`+`
`27`	`40`	`}`
`28`	`41`
`29`	`42`	`// console.log(nums);`
`@@ -40,6 +53,6 @@ function swap(nums, i, j) {`
`40`	`53`	`}`
`41`	`54`
`42`	`55`	`// console.log(firstMissingPositive([1, 2, 0]));`
`43`		`-//console.log(firstMissingPositive([3, 4, -1, 1]));`
	`56`	`+console.log(firstMissingPositive([3,4,-1,1]));`
`44`	`57`	`// console.log(firstMissingPositive([1, 1]));`
`45`		`-console.log(firstMissingPositive([2,2]));`
	`58`	`+//console.log(firstMissingPositive([2, 2]));`

Comments

(0)