[코테 풀이] Find if Digit Game Can Be Won

Q_3232) Find if Digit Game Can Be Won

출처 : https://leetcode.com/problems/find-if-digit-game-can-be-won/

class Solution {
    public boolean canAliceWin(int[] nums) {
        //try single-digit
        if (sum(nums, 1)) return true;
        else if (sum(nums, 2)) return true;
        return false;
    }

    public boolean sum(int[] nums, int target) {
        int targetSum = 0, restSum = 0;
        for (int i = 0; i < nums.length; i++) {
            if (Integer.toString(nums[i]).length() == target) {
                targetSum += nums[i];
            } else restSum += nums[i];
        }
        if (targetSum > restSum) return true;
        return false;
    }
}