判断是否是快乐数

最新推荐文章于 2024-09-19 01:00:00 发布

Devil-ly

最新推荐文章于 2024-09-19 01:00:00 发布

阅读量1.4k

点赞数

分类专栏： lintcode

本文链接：https://blog.csdn.net/ly3307410/article/details/62455800

版权

lintcode 专栏收录该内容

13 篇文章 0 订阅

订阅专栏

class Solution {
public:
    /**
     * @param n an integer
     * @return true if this is a happy number or false
     */
     #include <string>
     
    bool isHappy(int n) {
        // Write your code here
        vector<int> happy;
        int temp = n;
	    while (1)
	    {
	      happy.push_back(temp); 
		  temp = happyNum(temp);
		  if (temp == 1)
		  {
			 return true;
	      }
	      for(int i = 0; i < happy.size(); i++)
	      {
	         if (happy[i] == temp)
		     {
			   return false;
	         }
	      }
	

	    }
     
    }
    
    int happyNum(int num)
    {
   
      int sum = 0;
   
      while (num > 0) {
        sum += (num % 10) * (num % 10);
        num = num / 10;
        }
      
      return sum;
    }
};