LeetCodeQuestionTwo.java

/**
 * * Given an array nums of integers, return how many of them contain an even number of digits.
 * *
 * * Example 1:
 * * Input: nums = [12,345,2,6,7896]
 * * Output: 2
 * * Explanation:
 * *  - 12 contains 2 digits (even number of digits).
 * *  - 345 contains 3 digits (odd number of digits).
 * *  - 2 contains 1 digit (odd number of digits).
 * *  - 6 contains 1 digit (odd number of digits).
 * *  - 7896 contains 4 digits (even number of digits).
 * * Therefore only 12 and 7896 contain an even number of digits.
 * *
 * * Example 2:
 * * Input: nums = [555,901,482,1771]
 * * Output: 1
 * * Explanation:
 * * - Only 1771 contains an even number of digits.
 */

package com.basic.practice;

import lombok.extern.slf4j.Slf4j;

@Slf4j
public class LeetCodeQuestionTwo {

    public static void main(String[] args) {
//        int[] arrayOfNumbers = {12, 345, 2, 6, 7896};
        int[] arrayOfNumbers = {555, 901, 482, 1771};
        log.info("Problem: Find Numbers with Even Number of Digits");
        log.info("Output: {}", findNumbers(arrayOfNumbers));
    }

    static int findNumbers(int[] nums) {
        int evenCount = 0;
        for (int i = 0; i < nums.length; i++) {
            int count = 0;
            int rem;
            while (nums[i] > 0) {
                rem = nums[i] % 10;
                nums[i] = nums[i] / 10;
                count++;
            }

            if (count % 2 == 0) {
                evenCount++;
            }

        }

        return evenCount;
    }
}