Commit 740d2c6

committed

Update README and add test case for firstMissingPositive solution

1 parent 6fabffa commit 740d2c6Copy full SHA for 740d2c6

File tree

+34

-4

lines changed

+34

-4

lines changed

Lines changed: 1 addition & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -56,10 +56,7 @@`
`56`	`56`	`- Prefix sum &&& Suffix sum`
`57`	`57`	`- Prefix product &&& Suffix product`
`58`	`58`	`- Hash Table`
`59`		`-- Mark Indices`
`60`		`- - By negative value`
`61`		`- - By the index equals its value`
`62`		`- - By zeros if not the list contains zeros`
	`59`	`+- Mark Indices --> By negative value`
`63`	`60`	`-`
`64`	`61`
`65`	`62`

Lines changed: 33 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -28,6 +28,35 @@ class Solution {`
`28`	`28`	`}`
`29`	`29`	`return -1;`
`30`	`30`	`}`
	`31`	`+`
	`32`	`+ /// Udemy Solution`
	`33`	`+ // int firstMissingPositive(List<int> nums) {`
	`34`	`+ // int n = nums.length;`
	`35`	`+`
	`36`	`+ // // preprocess the array`
	`37`	`+ // for (int i = 0; i < n; i++) {`
	`38`	`+ // if (nums[i] <= 0) {`
	`39`	`+ // nums[i] = n + 1;`
	`40`	`+ // }`
	`41`	`+ // }`
	`42`	`+`
	`43`	`+ // // marking indices`
	`44`	`+ // for (int i = 0; i < n; i++) {`
	`45`	`+ // int index = nums[i].abs() - 1;`
	`46`	`+ // if (index < n && nums[index] > 0) {`
	`47`	`+ // nums[index] *= -1;`
	`48`	`+ // }`
	`49`	`+ // }`
	`50`	`+`
	`51`	`+ // // scan the array`
	`52`	`+ // for (int i = 0; i < n; i++) {`
	`53`	`+ // if (nums[i] > 0) {`
	`54`	`+ // return i + 1;`
	`55`	`+ // }`
	`56`	`+ // }`
	`57`	`+`
	`58`	`+ // return n + 1;`
	`59`	`+ // }`
`31`	`60`	`}`
`32`	`61`
`33`	`62`	`void runTests() {`
`@@ -39,6 +68,10 @@ void runTests() {`
`39`	`68`	`expect(s.firstMissingPositive([1, 2, 0]), equals(3));`
`40`	`69`	`});`
`41`	`70`
	`71`	`+ test('Example: [1, 2, 6, 3, 5, 4] → 3', () {`
	`72`	`+ expect(s.firstMissingPositive([1, 2, 6, 3, 5, 4]), equals(7));`
	`73`	`+ });`
	`74`	`+`
`42`	`75`	`test('Example 2: [3,4,-1,1] → 2', () {`
`43`	`76`	`expect(s.firstMissingPositive([3, 4, -1, 1]), equals(2));`
`44`	`77`	`});`

Comments

(0)