Given a non-empty array of numbers, a0, a1, a2, … , an-1, where 0 ≤ ai < 231. Find the maximum result of ai XOR aj, where 0 ≤ i, j < n. Could you do this in O(n) runtime? Example: Input: [3, 10, 5, 25, 2, 8] Output: 28 Explanation: The maximum resul…
The Address Book does not contain a cross certificate capable of validating the public key. 地址本不包含交叉证书验证公钥的能力. 解决方法: 对该数据库签名在Domino administrator-> 文件:选中数据库,点击右键,选择“签名”…