LeetCode-Happy Number-解题报告

原题链接 https://leetcode.com/problems/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
模拟法,模拟题中描述的方法即可。使用hash记录那个数字访问过没有就行了。


class Solution {
public:
    bool isHappy(int n) {
		unordered_map<int, bool>vis;
		while (n != 1)
		{
			vis[n] = true;
			n = getSs(n);
			if (vis[n])return false;
		}
		return true;
	}
	int getSs(int x)
	{
		int sum = 0;
		while (x)
		{
			int t = x % 10;
			sum += t*t;
			x /= 10;
		}
		return sum;
	}
};


阅读更多
文章标签: C++ leetcode
个人分类: leetcode
上一篇LeetCode-Remove Linked List Elements-解题报道
下一篇LeetCode-Bitwise AND of Numbers Range-解题报告
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭