class Solution {
    public int maximumStrongPairXor(int[] nums) {
        int maximum = 0;

        for (int i = 0; i < nums.length; i++) {
            for (int j = 0; j < nums.length; j++) {
                int x = nums[i];
                int y = nums[j];

                int diff = x - y;
                if (diff < 0) { // absolute value
                    diff = -diff;
                }

                if (diff <= Math.min(x, y)) {
                    // a strong pair
                    int xor = x ^ y;
                    if (xor > maximum) {
                        maximum = xor;
                    }
                }
            }
        }

        return maximum;
    }
}

impl Solution {
  pub fn maximum_strong_pair_xor(nums: Vec<i32>) -> i32 {
      let mut maximum = 0;

      for num1 in &nums {
          for num2 in &nums {
              let x: i32 = *num1;
              let y: i32 = *num2;

              let mut diff = x - y;
              if diff < 0 {
                  diff = -diff;
              }
              if diff <= std::cmp::min(x, y) {
                  let xor: i32 = x ^ y;

                  if (xor > maximum) {
                      maximum = xor;
                  }
              }
          }
      }

      return maximum;
  }
}