HashTable-202-Happy Number

最新推荐文章于 2024-09-24 22:07:02 发布

kevin聪

最新推荐文章于 2024-09-24 22:07:02 发布

阅读量219

点赞数

分类专栏：算法与数据结构 leetcode 文章标签：算法数据结构 leetcode

本文链接：https://blog.csdn.net/LaputaFallen/article/details/79132395

版权

算法与数据结构同时被 2 个专栏收录

569 篇文章 0 订阅

订阅专栏

leetcode

557 篇文章 12 订阅

订阅专栏

Description:
Write an algorithm to determine if a number is “happy”.

A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy numbers.

Example: 19 is a happy number


    12 + 92 = 82
    82 + 22 = 68
    62 + 82 = 100
    12 + 02 + 02 = 1

Solution:

若出现重复项，则返回false
class Solution {
    public boolean isHappy(int n) {
        Set<Integer> set = new HashSet<Integer>();
        while(set.add(n)){
            int squareSum = 0;
            int remain = 0;
            while(n > 0){
                remain = n % 10;
                squareSum += remain * remain;
                n = n / 10;
            }
            if(squareSum == 1) return true;
            n = squareSum;
        }
        return false;
    }
}

Better Solution:

class Solution {
    /*
    Unhappy numbers follow cycle -> 4, 16, 37, 58, 89, 145, 42, 20, 4...
    */
    public boolean isHappy(int n){
        int sum = 0;
        while(n > 0){
            int digit = n% 10;
            sum += digit * digit;
            n = n/10;
        }

        if(sum == 1){
            return true;
        }
        if(sum == 4){
            return false;
        }

        return isHappy(sum);
    }
}