Commit3340ef1

authored

Update 0128-longest-consecutive-sequence.rb

More concise solution that is similar to python solution demonstrated in youtube video.

1 parenta14fcbd commit3340ef1Copy full SHA for 3340ef1

File tree

+11

-49

lines changed

+11

-49

lines changed

Lines changed: 11 additions & 49 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,52 +1,14 @@`
`1`	`1`	`deflongest_consecutive(nums)`
`2`		`-return0ifnums.empty?`
`3`		`-`
`4`		`-hash={}`
`5`		`-nums.each{ \|num\|hash[num]=true}`
`6`		`-longest=0`
`7`		`-nums.eachdo \|num\|`
`8`		`-nextifhash[num -1]`
`9`		`-`
`10`		`-challenger=1`
`11`		`-loopdo`
`12`		`-ifhash[num +challenger]`
`13`		`-challenger +=1`
`14`		`-else`
`15`		`-break`
`16`		`-end`
`17`		`-end`
`18`		`-longest=challengerifchallenger >longest`
`19`		`-end`
`20`		`-`
`21`		`-longest`
`22`		`-end`
`23`		`-`
`24`		`-# Another way to do it.`
`25`		`-deflongest_consecutive(nums)`
`26`		`-return0ifnums.empty?`
`27`		`-`
`28`		`-hash={}`
`29`		`-nums.each{ \|num\|hash[num]= -1}`
`30`		`-nums.eachdo \|num\|`
`31`		`-nextunlesshash[num] == -1`
`32`		`-`
`33`		`-longest_consec=1`
`34`		`-loopdo`
`35`		`-val=hash[num +longest_consec]`
`36`		`-caseval`
`37`		`-when -1`
`38`		`-hash[num +longest_consec]= -2`
`39`		`-longest_consec +=1`
`40`		`-whennil`
`41`		`-hash[num]=longest_consec`
`42`		`-break`
`43`		`-else`
`44`		`-longest_consec +=hash[num +longest_consec]`
`45`		`-hash[num]=longest_consec`
`46`		`-break`
`47`		`-end`
	`2`	`+set=Set.new(nums)`
	`3`	`+set.reduce(0)do \|longest,num\|`
	`4`	`+if !set.include?(num-1)`
	`5`	`+length=0`
	`6`	`+whileset.include?(num +length)do`
	`7`	`+length +=1`
	`8`	`+end`
	`9`	`+next(longest >length ?longest :length)`
	`10`	`+end`
	`11`	`+`
	`12`	`+longest`
`48`	`13`	`end`
`49`		`-end`
`50`		`-`
`51`		`-hash.max_by{ \|_k,v\|v}[1]`
`52`	`14`	`end`

Comments

(0)