leetcode_202_Happy Number

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

• 1² + 9² = 82
• 8² + 2² = 68
• 6² + 8² = 100
• 1² + 0² + 0² = 1

I did this problem after [258_Add Digits], so I thought if there was a magic way to do this problem. I found these links:

http://blog.csdn.net/angelazy/article/details/45286625

http://blog.csdn.net/xudli/article/details/45267247

http://www.cnblogs.com/ganganloveu/p/4469917.html

http://blog.csdn.net/wangyaninglm/article/details/45368921

https://leetcode.com/discuss/33014/4ms-5-line-c-code

https://en.wikipedia.org/wiki/Happy_number

And below is my code:

#include <iostream>
using namespace std;

class Solution
{
public:
  bool isHappy(int n)
  {
    int copy = n;
    int sum = 0;
    while (copy != 0)
    {
      sum += (copy%10) * (copy%10);
      copy /= 10;
    }
    if (sum > 6)
      isHappy(sum);
    else if (sum == 1)
      return true;
    else
      return false;
  }
};

int main()
{
  Solution s;
  int n;
  cin >> n;
  cout << s.isHappy(n) << endl;
  
  return 0;
}

I used some observation which mentioned in above links.

I learned unordered_set from some links too.