Commit2b7ce14

committed

longest consecutive sequence using HashSet

1 parent8f6b16b commit2b7ce14Copy full SHA for 2b7ce14

File tree

+28

-0

lines changed

+28

-0

lines changed

Lines changed: 28 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -58,4 +58,32 @@ public int maxUnion(){//this is O(n)`
`58`	`58`	`returnmax;`
`59`	`59`	`}`
`60`	`60`	`}`
	`61`	`+`
	`62`	`+classSolution_using_HashSet{`
	`63`	`+//inspired by this solution: https://discuss.leetcode.com/topic/25493/simple-fast-java-solution-using-set`
	`64`	`+publicintlongestConsecutive(int[]nums) {`
	`65`	`+if(nums ==null \|\|nums.length ==0)return0;`
	`66`	`+`
	`67`	`+Set<Integer>set =newHashSet();`
	`68`	`+for(inti :nums)set.add(i);`
	`69`	`+intmax =1;`
	`70`	`+`
	`71`	`+for(intnum :nums){`
	`72`	`+if(set.remove(num)){`
	`73`	`+intval =num;`
	`74`	`+intcount =1;`
	`75`	`+while(set.remove(val-1))val--;//we find all numbers that are smaller than num and remove them from the set`
	`76`	`+count +=num -val;`
	`77`	`+`
	`78`	`+val =num;`
	`79`	`+while(set.remove(val+1))val++;//then we find all numbers that are bigger than num and also remove them from the set`
	`80`	`+count +=val -num;`
	`81`	`+`
	`82`	`+max =Math.max(max,count);`
	`83`	`+ }`
	`84`	`+ }`
	`85`	`+returnmax;`
	`86`	`+ }`
	`87`	`+`
	`88`	`+ }`
`61`	`89`	`}`

Comments

(0)