代码挑战：幸福数字 | Go
【摘要】 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 ...
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:
Input: 19
Output: true
Explanation:
12 + 92 = 82
82 + 22 = 68
62 + 82 = 100
12 + 02 + 02 = 1方案：
func isHappy(n int) bool {
m := make(map[int]bool)
ok := false
for !ok {
m[n] = true
v := 0
for n > 0 {
v += int(math.Pow(float64(n%10), 2))
n /= 10
}
n = v
_, ok = m[n]
}
return n == 1
}
测试案例：
func Test_isHappy(t *testing.T) {
type args struct {
n int
}
tests := []struct {
name string
args args
want bool
}{
{"test1", args{n: 19}, true},
{"test2", args{n: 4}, false},
{"test3", args{n: 123}, false},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
if got := isHappy(tt.args.n); got != tt.want {
t.Errorf("isHappy() = %v, want %v", got, tt.want)
}
})
}
}
【版权声明】本文为华为云社区用户原创内容，转载时必须标注文章的来源（华为云社区）、文章链接、文章作者等基本信息， 否则作者和本社区有权追究责任。如果您发现本社区中有涉嫌抄袭的内容，欢迎发送邮件进行举报，并提供相关证据，一经查实，本社区将立刻删除涉嫌侵权内容，举报邮箱：
cloudbbs@huaweicloud.com
- 点赞
- 收藏
- 关注作者
评论（0）