OpenSoure_Repos/TheAlgorithms-Python
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/Python.git synced 2023-10-11 13:06:12 +08:00
Code Issues Packages Projects Releases Wiki Activity

[pre-commit.ci] auto fixes from pre-commit.com hooks

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2023-10-09 10:16:49 +00:00
parent 3913a78ab2
commit b791b0e6d7
1 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
dynamic_programming/nth_ugly_number.py
View File

@ -27,8 +27,9 @@ O(n) - The algorithm uses an array of size n to store the ugly numbers.
Sources:
- Dynamic Programming and Ugly Numbers: https://www.geeksforgeeks.org/ugly-numbers/
"""
def nth_ugly_number(n: int) -> int:
def nth_ugly_number(n: int) -> int:
"""
Return the nth ugly number.
>>> nth_ugly_number(5)
@ -43,7 +44,7 @@ def nth_ugly_number(n: int) -> int:
"""
if n < 0:
raise ValueError("Index for nth ugly number should be ≥ 0")
raise ValueError("Index for nth ugly number should be ≥ 0")
dp = [1] * (n + 1)
ptr1 = 0
ptr2 = 0
@ -62,8 +63,8 @@ def nth_ugly_number(n: int) -> int:
return dp[n - 1]
if __name__ == "__main__":
if __name__ == "__main__":
# User input to find the nth Ugly Number
print("\n********* Ugly Numbers Using Dynamic Programming ************\n")
print("\n*** Enter -1 to quit ***")
@ -75,7 +76,6 @@ if __name__ == "__main__":
print("\n********* END ************")
break
else:
ugly_number = nthUglyNumber(n)
print(f"The {n}th Ugly Number is: {ugly_number}")
print("Try another index to find a Ugly Number: ", end="")