HTMLify
Day 114
Views: 2 | Author: djdj
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 | class Solution { /** * @param Integer[] $nums * @return Integer */ function maximumStrongPairXor($nums) { $maxXor = []; for ($i = 0; $i < count($nums); $i++) { for ($j = $i; $j < count($nums); $j++) { if (abs($nums[$i] - $nums[$j]) <= min($nums[$i], $nums[$j])) $xorValue[] = $nums[$i] ^ $nums[$j]; } } return max($xorValue); } } |