LeetCode 202. Happy Number (迭代,各位平方和)
来源:互联网 发布:mac系统如何格式化u盘 编辑:程序博客网 时间:2024/06/14 05:58
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
思路:按照步骤逐位计算平方再求和。当n迭代到个位数时,利用先验知识:个位数中只有1和7是happy number,如果是1或7则返回true,否则返回false。
bool isHappy(int n) { int sum=0; while(n>=10) { while(n) { sum+=pow(n%10,2); n/=10; } n=sum; sum=0; } if(n==1||n==7)return 1; else return 0; }
阅读全文
0 0
- 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
- 202. Happy Number LeetCode
- 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
- spring中JdbcTemplate
- 一个maven项目pom配置
- git别名
- hnust
- WebSocket 是什么原理?为什么可以实现持久连接?
- LeetCode 202. Happy Number (迭代,各位平方和)
- BZOJ 4320: ShangHai2006 Homework
- asd
- Struts2配置图解
- Problem D: STL——括号匹配
- java内存同步模型
- 查询进程打开的文件(转)
- ubuntu 16.04安装使用leap motion
- USACO-Section1.2 Transformations [其他]