Commitd27b620

authored

Update Longest Consecutive Sequence.java

1 parent7412f6f commitd27b620Copy full SHA for d27b620

File tree

+14

-12

lines changed

+14

-12

lines changed

Lines changed: 14 additions & 12 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,19 +1,21 @@`
`1`	`1`	`classSolution {`
`2`	`2`	`publicintlongestConsecutive(int[]nums) {`
`3`		`-Map<Integer,Integer>map =newHashMap<>();`
`4`		`-intmaxLength =0;`
	`3`	`+Set<Integer>set =newHashSet<>();`
`5`	`4`	`for (intnum :nums) {`
`6`		`-if (map.containsKey(num)) {`
`7`		`-continue;`
	`5`	`+set.add(num);`
	`6`	`+ }`
	`7`	`+intmaxLength =0;`
	`8`	`+for (intnum :set) {`
	`9`	`+if (!set.contains(num -1)) {`
	`10`	`+intcurrNum =num;`
	`11`	`+intcurrentLength =1;`
	`12`	`+while (set.contains(currNum +1)) {`
	`13`	`+currNum++;`
	`14`	`+currentLength++;`
	`15`	`+ }`
	`16`	`+maxLength =Math.max(currentLength,maxLength);`
`8`	`17`	`}`
`9`		`-intleft =map.containsKey(num -1) ?map.get(num -1) :0;`
`10`		`-intright =map.containsKey(num +1) ?map.get(num +1) :0;`
`11`		`-intsum =left +right +1;`
`12`		`-maxLength =Math.max(maxLength,sum);`
`13`		`-map.put(num,sum);`
`14`		`-map.put(num -left,sum);`
`15`		`-map.put(num +right,sum);`
`16`	`18`	`}`
`17`	`19`	`returnmaxLength;`
`18`		`- }`
	`20`	`+ }`
`19`	`21`	`}`

Comments

(0)