[pull] master from wisdompeak:master #356

Original file line number	Diff line number	Diff line change
Expand Up		@@ -702,7 +702,8 @@
		[1858.Longest-Word-With-All-Prefixes](https://github.com/wisdompeak/LeetCode/tree/master/Trie/1858.Longest-Word-With-All-Prefixes) (M)
		[2416.Sum-of-Prefix-Scores-of-Strings](https://github.com/wisdompeak/LeetCode/tree/master/Trie/2416.Sum-of-Prefix-Scores-of-Strings) (M)
		[2977.Minimum-Cost-to-Convert-String-II](https://github.com/wisdompeak/LeetCode/tree/master/Trie/2977.Minimum-Cost-to-Convert-String-II) (H)
	[3093.Longest-Common-Suffix-Queries](https://github.com/wisdompeak/LeetCode/tree/master/Trie/3093.Longest-Common-Suffix-Queries) (H-)
	[3093.Longest-Common-Suffix-Queries](https://github.com/wisdompeak/LeetCode/tree/master/Trie/3093.Longest-Common-Suffix-Queries) (H-)
	[3670.Maximum-Product-of-Two-Integers-With-No-Common-Bits](https://github.com/wisdompeak/LeetCode/tree/master/Trie/3670.Maximum-Product-of-Two-Integers-With-No-Common-Bits) (H-)
		* ``Trie and XOR``
		[421.Maximum-XOR-of-Two-Numbers-in-an-Array](https://github.com/wisdompeak/LeetCode/tree/master/Trie/421.Maximum-XOR-of-Two-Numbers-in-an-Array) (H-)
		[1707.Maximum-XOR-With-an-Element-From-Array](https://github.com/wisdompeak/LeetCode/tree/master/Trie/1707.Maximum-XOR-With-an-Element-From-Array) (H-)
Expand Down

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,61 @@
	class TrieNode {
	public:
	TrieNode* next[2];
	TrieNode()
	{
	for (int i=0; i<2; i++)
	next[i]=NULL;
	}
	};

	class Solution {
	TrieNode* root;
	public:
	void add(int x) {
	TrieNode* node = root;
	for (int i=0; i<31; i++) {
	int b = ((x>>(30-i))&1);
	if (!node->next[b])
	node->next[b] = new TrieNode();
	node = node->next[b];
	}
	}

	int dfs(TrieNode* node, int i, int x) {
	if (node==NULL) {
	return -1;
	}
	if (i==31) return 0;

	int b = ((x>>(30-i))&1);

	if (b==1) {
	int ans = dfs(node->next[0], i+1, x);
	if (ans!=-1) return ans;
	else return -1;
	}
	else {
	int ans1 = dfs(node->next[1], i+1, x);
	int ans2 = dfs(node->next[0], i+1, x);
	if (ans1!=-1)
	return (1<<(30-i))+ans1;
	if (ans2!=-1)
	return ans2;
	return -1;
	}
	}

	long long maxProduct(vector<int>& nums) {
	root = new TrieNode();
	int n = nums.size();

	long long ret = 0;
	for (int x: nums) {
	int ans = dfs(root, 0, x);
	if (ans!=-1) ret = max(ret, (long long)x*ans);
	add(x);
	}

	return ret;
	}
	};

Navigation Menu