3513. Number of Unique XOR Triplets I

class Solution {
    public int uniqueXorTriplets(int[] nums) {
        int n = nums.length;
        if (n == 1) return 1;
        if (n == 2) return 2;
        int ans = 1;
        while (ans <= n) {
            ans <<= 1;
        }
        return ans;
    }
}

class Solution:
    def uniqueXorTriplets(self, nums):
        n = len(nums)

        if n == 1:
            return 1
        if n == 2:
            return 2

        ans = 1
        while ans <= n:
            ans <<= 1

        return ans

class Solution {
public:
    int uniqueXorTriplets(vector<int>& nums) {
        int n = nums.size();

        if (n == 1) return 1;
        if (n == 2) return 2;

        int ans = 1;
        while (ans <= n) {
            ans <<= 1;
        }

        return ans;
    }
};

var uniqueXorTriplets = function(nums) {
    const n = nums.length;

    if (n === 1) return 1;
    if (n === 2) return 2;

    let ans = 1;
    while (ans <= n) {
        ans <<= 1;
    }

    return ans;
};