[leetcode] Happy Number

浏览数：29 / 时间：2015年06月11日

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

  • 12 + 92 = 82
  • 82 + 22 = 68
  • 62 + 82 = 100
  • 12 + 02 + 02 = 1
 
Credits:
Special thanks to @mithmatt and @ts for adding this problem and creating all test cases.
 
const int SIZE = 1000;

class Solution
{
private:
  bool isExist(int n)
  {
    for(int i=0; i<SIZE; i++)
      if(A[i] == n)
        return true;

    return false;
  }

public:
  bool isHappy(int n)
  {
    int m = 0, index = 0;
    while(1 != n)
    {
      m = 0;
      while(n)
      {
        m += pow(n%10, 2);
        n /= 10;
      }
      n = m;

      if(isExist(n))
        return false;

      A[index++] = n;
    }

    return true;
  }

private:
  int A[SIZE];
};

 

郑重声明：本站内容如果来自互联网及其他传播媒体，其版权均属原媒体及文章作者所有。转载目的在于传递更多信息及用于网络分享，并不代表本站赞同其观点和对其真实性负责，也不构成任何其他建议。

标签： Android iOS 移动互联 终端开发

相关文章

随机文章

您可能还喜欢

您可能还喜欢