LeetCode/202.cpp at master · nitin-maharana/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
/*
 * Written by Nitin Kumar Maharana
 * nitin.maharana@gmail.com
 */

class Solution {
    set<int> memory;
public:
    int findSquare(int n)
    {
        int result = 0, tempRes;

        while(n)
        {
            tempRes = n % 10;
            result += (tempRes*tempRes);
            n /= 10;
        }

        return result;
    }

    bool isHappy(int n) {
        if(n == 1)
            return true;

        memory.insert(n);

        while(n != 1)
        {
            n = findSquare(n);

            if(memory.find(n) != memory.end())
                break;

            memory.insert(n);
        }

        return (n==1);
    }
};