__________________________________________________________________________________________________
class Solution {
    public boolean isArmstrong(int N) {
        char[] s = Integer.toString(N).toCharArray();
        long t = 0;
        for(char c : s){
            t += (long)Math.pow((c-'0'), s.length);
        }
        return t == N;
    }
}
__________________________________________________________________________________________________

__________________________________________________________________________________________________
