(n: i32)
| 4 | |
| 5 | impl Solution { |
| 6 | pub fn is_happy(n: i32) -> bool { |
| 7 | let mut set = HashSet::new(); |
| 8 | let mut n = n; |
| 9 | let mut new_n: i32; |
| 10 | while !set.contains(&n) { |
| 11 | set.insert(n); |
| 12 | new_n = 0; |
| 13 | while n > 0 { |
| 14 | new_n += (n % 10).pow(2); |
| 15 | n /= 10; |
| 16 | } |
| 17 | n = new_n; |
| 18 | } |
| 19 | n == 1 |
| 20 | } |
| 21 | } |
| 22 | |
| 23 | fn main() { |