6090. Minimax games

class Solution {
public:
    int minMaxGame(vector<int>& nums) {
      
      int i = 0;
      int len = nums.size();
      
      while(len != 1){
        // i Accessible location 
        int availableLen = len >> 1;

        while(i < availableLen){
          
          int ind = (i << 1);
          
          if(1 == (i & 0x01)){
            //  Odd number 
            nums[i] = max(nums[ind], nums[ind + 1]);
          }else{
            //  even numbers 
            nums[i] = min(nums[ind], nums[ind + 1]);
          }
          
          i++;
        }
        
        //  Start the next visit 
        i = 0;

        //  Half and half 
        len >>= 1;
      }
      
      return nums[0];
    }
};