202. Happy Number
来源:互联网 发布:机房网络静电地板 编辑:程序博客网 时间:2024/05/12 06:11
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
public class Solution { public boolean isHappy(int n) { Set<Integer> numberSet = new HashSet<Integer>(); while (n!=1){ if (numberSet.add(n)==false){ return false; } char[] chars = String.valueOf(n).toCharArray(); int total = 0; for (Character ch: chars){ total += Math.pow(Integer.parseInt(ch+""),2); } n = total; } return true; }}//同计算循环小数一样, 如果出现循环, 则无需继续计算,直接返回false即可. //按照描述来做就可以了,把每位的平方累加,得到新数字,如果和为1则返回true,否则使用哈希来存已经计算过的数字。如果已经在哈希中存//在,返回false。
0 0
- 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] 202. Happy Number
- 202. Happy Number LeetCode
- 202. Happy Number
- leetCode 202. Happy Number
- 202. Happy Number
- 202. Happy Number
- 202. Happy Number
- [LeetCode]202. Happy Number
- leetcode 202. Happy Number
- 202. Happy Number
- 202. Happy Number
- 线程的实现(通过继承Thread类实现调用start())
- Shiro学习(4)INI配置
- Android Studio导入jar包和删除jar包
- bzoj3306: 树
- 深入理解Objective-C:Category(上)
- 202. Happy Number
- 根据MRP建议对采购订单需求日期的建议修改采购订单需求日期 (续)
- ANDROID L——Material Design详解(主题和布局)
- MAC下安装与配置MySQL
- android Service传值
- loadView、viewDidLoad及viewDidUnload的关系
- 线程的实现(通过实现Runnable接口启动线程)
- 如何保证返回按钮点击后始终有反映
- codeforces#308-E - Vanya and Brackets-枚举+表达式计算