Commitf35afca

committed

refactor 645

1 parent1ef0f80 commitf35afcaCopy full SHA for f35afca

File tree

+23

-0

lines changed

+23

-0

lines changed

Lines changed: 23 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,8 @@`
`1`	`1`	`packagecom.fishercoder.solutions;`
`2`	`2`
`3`	`3`	`importjava.util.Arrays;`
	`4`	`+importjava.util.HashSet;`
	`5`	`+importjava.util.Set;`
`4`	`6`
`5`	`7`	`publicclass_645 {`
`6`	`8`	`publicstaticclassSolution1 {`
`@@ -22,4 +24,25 @@ public int[] findErrorNums(int[] nums) {`
`22`	`24`	`returnresult;`
`23`	`25`	`}`
`24`	`26`	`}`
	`27`	`+`
	`28`	`+publicstaticclassSolution2 {`
	`29`	`+publicint[]findErrorNums(int[]nums) {`
	`30`	`+Set<Integer>set =newHashSet();`
	`31`	`+boolean[]has =newboolean[nums.length];`
	`32`	`+intdup = -1;`
	`33`	`+for (inti =0;i <nums.length;i++) {`
	`34`	`+has[nums[i] -1] =true;`
	`35`	`+if (!set.add(nums[i])) {`
	`36`	`+dup =nums[i];`
	`37`	`+ }`
	`38`	`+ }`
	`39`	`+intdup2 = -1;`
	`40`	`+for (inti =0;i <has.length;i++) {`
	`41`	`+if (!has[i]) {`
	`42`	`+dup2 =i +1;`
	`43`	`+ }`
	`44`	`+ }`
	`45`	`+returnnewint[]{dup,dup2};`
	`46`	`+ }`
	`47`	`+ }`
`25`	`48`	`}`

Comments

(0)