LeetCode之Happy Number

2024-05-23 13:56:33

1、题目

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

Credits:
Special thanks to @mithmatt and @ts for adding this problem and creating all test cases.

Subscribe to see which companies asked this question.

2、分析

这个题目每次会把每位的平方相加，然后循环这样，然后知道这个数字等于1为止，经过我们举例分析，如果不是快乐数最终或者中途出现这些数字，最後都会进入 4 → 16 → 37 → 58 → 89 → 145 → 42 → 20 → 4 的循环中

3、代码实现

public class Solution {public boolean isHappy(int n) {if (n <= 0)return false;int result = 0;while (n != 0) {int temp = n % 10;result += temp * temp;n = n / 10;}if (result == 1) return true;else if (result == 4 || result == 16  || result == 37 || result == 58 || result == 89 || result == 145 || result == 42 || result == 20 )return false;else return isHappy(result);}
}

LeetCode之Happy Number相关推荐

LeetCode：Largest Number - 求整型数组中各元素可拼合成的最大数字
2019独角兽企业重金招聘Python工程师标准>>> 1.题目名称 Largest Number(求整型数组中各元素可拼合成的最大数字) 2.题目地址 https://leetco ...
【整数转字符串】LeetCode 9. Palindrome Number
LeetCode 9. Palindrome Number Solution1: 不利用字符串 class Solution { public:bool isPalindrome(int x) {if ...
【To Do! 重点正则表达式】LeetCode 65. Valid Number
LeetCode 65. Valid Number 本博客转载自:[1]http://www.cnblogs.com/yuzhangcmu/p/4060348.html [2]https://blog ...
【回文串2】LeetCode 9. Palindrome Number
LeetCode 9. Palindrome Number Solution1:我的答案思路一:转化为字符串 class Solution { public:bool isPalindrome(in ...
【？异或】LeetCode 260. Single Number III
LeetCode 260. Single Number III Solution1: 博客转载自:http://www.cnblogs.com/grandyang/p/4741122.html 这道题 ...
【异或】LeetCode 137. Single Number II
LeetCode 137. Single Number II Solution1:不会做,抄的博客转载自:http://www.cnblogs.com/grandyang/p/4263927.htm ...
【异或】LeetCode 136. Single Number
LeetCode 136. Single Number Solution1:我的答案还好异或的性质没记错,还好,还好 class Solution { public:int singleNumber ...
[LeetCode]179. Largest Number
[LeetCode]179. Largest Number 题目描述解题思路求最大的数,在数组中对于每一位数字数值越大应当越靠前,如:9 > 5,所以9应该在5之前需要考虑的是对于不同位数 ...
LeetCode 871. Minimum Number of Refueling Stops 最少加油次数
LeetCode 871. Minimum Number of Refueling Stops 本题是LeetCode 871题,最少加油次数. 题目描述 A car travels from a s ...
LeetCode: 871. Minimum Number of Refueling Stops
LeetCode: 871. Minimum Number of Refueling Stops 题目描述 A car travels from a starting position to a de ...

最新文章

热门文章