Find if Digit Game Can Be Won

You are given an array of positive integers nums.

Alice and Bob are playing a game. In the game, Alice can choose either all single-digit numbers or all double-digit numbers from nums, and the rest of the numbers are given to Bob. Alice wins if the sum of her numbers is strictly greater than the sum of Bob's numbers.

Return true if Alice can win this game, otherwise, return false.

LeetCode Problem - 3232

class Solution {
    public boolean canAliceWin(int[] nums) {

        // Initialize variables to keep track of sums of single and double-digit numbers
        int sumSingleDigit = 0;
        int doubleDigit = 0;

        // Iterate through the array of numbers
        for(int e : nums) {
            // If the number is a single-digit number (less than 10), add it to sumSingleDigit
            if(e < 10) sumSingleDigit += e;
            // If the number is a double-digit number (10 or greater), add it to doubleDigit
            else doubleDigit += e;
        }

        // Compare the sums of single and double-digit numbers
        // If they are not equal, Alice can win, so return true
        if(sumSingleDigit != doubleDigit) return true;

        // If the sums are equal, Alice cannot win, so return false
        return false;
    }
}