Commit caa2ca1

committed

updated

1 parent eb68eba commit caa2ca1Copy full SHA for caa2ca1

File tree

+10

-6

lines changed

+10

-6

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -612,8 +612,8 @@ tree.`
`612`	`612`	`The power set of a set is the set of all its subsets. Write a function that,`
`613`	`613`	`given a set, generates its power set.`
`614`	`614`
`615`		`-For example, given the set {1, 2, 3}, it should return {{}, {1}, {2}, {3}, {1,`
`616`		`-2}, {1, 3}, {2, 3}, {1, 2, 3}}.`
	`615`	+For example, given the set `{1, 2, 3}`, it should return `{{}, {1}, {2}, {3}, {1,
	`616`	+2}, {1, 3}, {2, 3}, {1, 2, 3}}`.
`617`	`617`
`618`	`618`	`You may also use a list or array to represent a set.`
`619`	`619`

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -13,4 +13,6 @@ repositories {`
`13`	`13`
`14`	`14`	`dependencies {`
`15`	`15`	`testImplementation('org.junit.jupiter:junit-jupiter:5.4.2')`
	`16`	`+`
	`17`	`+`
`16`	`18`	`}`

Lines changed: 6 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -17,11 +17,13 @@ int getLongestConsecutiveSequenceLength(int[] numbers) {`
`17`	`17`	`int max = 0;`
`18`	`18`	`for (int n : numbers) {`
`19`	`19`	`int k = n;`
`20`		`- int count = 1;`
`21`		`- while (set.contains(++k)) {`
`22`		`- count++;`
	`20`	`+ if (!set.contains(k - 1)) {`
	`21`	`+ int count = 1;`
	`22`	`+ while (set.contains(++k)) {`
	`23`	`+ count++;`
	`24`	`+ }`
	`25`	`+ max = Math.max(max, count);`
`23`	`26`	`}`
`24`		`- max = Math.max(max, count);`
`25`	`27`	`}`
`26`	`28`	`return max;`
`27`	`29`	`}`

Comments

(0)