Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 202 with 14 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 202 # by problem number
lcpy gen -s happy_number # by problem name
n is happy.
A happy number is a number defined by the following process:
true if n is a happy number, and false if not.
Input: n = 19
Output: true
Input: n = 2
Output: false
class Solution:
# Time: O(log n)
# Space: O(log n)
def is_happy(self, n: int) -> bool:
def digit_square_sum(num: int) -> int:
total = 0
while num:
digit = num % 10
total += digit * digit
num //= 10
return total
slow, fast = n, digit_square_sum(n)
while fast != 1 and slow != fast:
slow = digit_square_sum(slow)
fast = digit_square_sum(digit_square_sum(fast))
return fast == 1
| Time | Space |
|---|---|
| O(log n) | O(log n) |