Skip to content

Commit f16e119

wisdompeak wisdompeak

authored

Update 3670.Maximum-Product-of-Two-Integers-With-No-Common-Bits.cpp

1 parent b7e9bcc commit f16e119Copy full SHA for f16e119

File tree

1 file changed

+3

-4

lines changed

Trie/3670.Maximum-Product-of-Two-Integers-With-No-Common-Bits
- 3670.Maximum-Product-of-Two-Integers-With-No-Common-Bits.cpp

1 file changed

+3

-4

lines changed

`‎Trie/3670.Maximum-Product-of-Two-Integers-With-No-Common-Bits/3670.Maximum-Product-of-Two-Integers-With-No-Common-Bits.cpp`

Lines changed: 3 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -27,18 +27,17 @@ class Solution {`
`27`	`27`	`}`
`28`	`28`	`if (i==31) return 0;`
`29`	`29`
`30`		`- int b = ((x>>(30-i))&1);`
`31`		`-`
	`30`	`+ int b = ((x>>(30-i))&1);`
`32`	`31`	`if (b==1) {`
`33`	`32`	`int ans = dfs(node->next[0], i+1, x);`
`34`	`33`	`if (ans!=-1) return ans;`
`35`	`34`	`else return -1;`
`36`	`35`	`}`
`37`	`36`	`else {`
`38`		`- int ans1 = dfs(node->next[1], i+1, x);`
`39`		`- int ans2 = dfs(node->next[0], i+1, x);`
	`37`	`+ int ans1 = dfs(node->next[1], i+1, x);`
`40`	`38`	`if (ans1!=-1)`
`41`	`39`	`return (1<<(30-i))+ans1;`
	`40`	`+ int ans2 = dfs(node->next[0], i+1, x);`
`42`	`41`	`if (ans2!=-1)`
`43`	`42`	`return ans2;`
`44`	`43`	`return -1;`

0 commit comments

Comments

(0)