[LeetCode]202. Happy Number
2017-04-29 23:00
267 查看
[LeetCode]202. Happy Number
题目描述
思路
没找到规律,只好用暴力做了代码
#include <iostream> using namespace std; class Solution { public: bool isHappy(int n) { while (n > 9) { int next = 0; while (n) { next += (n % 10) * (n % 10); n /= 10; } n = next; } return n == 1 || n == 7; } }; int main() { Solution s; cout << s.isHappy(19) << endl; system("pause"); return 0; }
相关文章推荐
- LeetCode 202 Happy Number(floyd判圈算法(龟兔赛跑算法))
- LeetCode 202.Happy Number 利用存储结构或快慢指针
- leetcode 202 Happy Number
- 【leetcode】202. Happy Number
- LeetCode202. Happy Number
- Leetcode 202. Happy Number
- [leetcode] 202. Happy Number
- [leetcode]202. Happy Number
- leetcode 202. Happy Number
- LeetCode 202:Happy Number
- Leetcode 202 Happy Number
- leetcode 202. Happy Number | 循环检测
- leetcode 202:Happy number
- leetcode -202. Happy Number
- leetcode 202. Happy Number
- [leetcode-202]Happy Number(java)
- LeetCode 202. Happy Number
- [LeetCode]202. Happy Number
- Leetcode 202 Happy Number
- LeetCode 202 : Happy Number