public class Solution {
    public boolean isArmstrong(int num) {

        int original = num;
        int digits = String.valueOf(num).length();
        int sum = 0;

        while (num > 0){
            int digit = num % 10;

            int power = 1;
            for (int i =0; i < digits; i++){
                power *=digit;
            }

            sum += power;
            num /= 10;
        }

        return sum == original;

    }
}