Top Interview 150 P202 Happy Number

---

Timeline

timeline

2025-11-13

init

hash table

---

Problem:

P202 Happy Number

https://leetcode.cn/problems/happy-number/submissions/677941045/?envType=study-plan-v2&envId=top-interview-150

The loop is similar to a for loop, so it is written in the form of a for loop.

#include <unordered_set>

using std::unordered_set;

class Solution {
    public:
	int ops(int n)
	{
		int res = 0;
		int num;
		while (n) {
			num = n % 10;
			res += num * num;
			n /= 10;
		}
		return res;
	}
	bool isHappy(int n)
	{
		unordered_set<int> numbers;
		int i;
		
		for (i = n; numbers.count(i) == 0; i = ops(i)) {
			if (i == 1) {
				return true;
			}
			numbers.insert(i);
		}

		return false;
	}
};