Commit cd335dc

author

mukul

committed

41. First Missing Positive

1 parent 8a907b6 commit cd335dcCopy full SHA for cd335dc

File tree

-8

lines changed

-8

lines changed

Lines changed: 8 additions & 8 deletions

Original file line number	Diff line number	Diff line change
`@@ -35,17 +35,17 @@ If all elements are in their correct positions, the function returns the next po`
`35`	`35`	`* @return {number}`
`36`	`36`	`*/`
`37`	`37`	`var firstMissingPositive = function(nums) {`
`38`		`- const n = nums.length`
	`38`	`+ const n = nums.length`
`39`	`39`
`40`		`- for (let i = 0; i < n; i++)`
`41`		`- while (nums[i] > 0 && nums[i] <= n && nums[nums[i] - 1] !== nums[i])`
`42`		`- [nums[nums[i] - 1], nums[i]] = [nums[i], nums[nums[i] - 1]]`
	`40`	`+ for (let i = 0; i < n; i++)`
	`41`	`+ while (nums[i] > 0 && nums[i] <= n && nums[nums[i] - 1] !== nums[i])`
	`42`	`+ [nums[nums[i] - 1], nums[i]] = [nums[i], nums[nums[i] - 1]]`
`43`	`43`
`44`		`- for (let i = 0; i < n; i++)`
`45`		`- if (nums[i] !== i + 1)`
`46`		`- return i + 1`
	`44`	`+ for (let i = 0; i < n; i++)`
	`45`	`+ if (nums[i] !== i + 1)`
	`46`	`+ return i + 1`
`47`	`47`
`48`		`- return n + 1`
	`48`	`+ return n + 1`
`49`	`49`	`};`
`50`	`50`
`51`	`51`	`module.exports.firstMissingPositive = firstMissingPositive;`

Comments

(0)