Leetcode Problem 264. Ugly Number II

264. Ugly Number II

Leetcode Solutions

Initialize an array nums with a size of 1690 and set the first element to 1 (the first ugly number).
Initialize three pointers i2, i3, and i5 to 0, which will track the position of the last number multiplied by 2, 3, and 5, respectively.
Loop 1689 times (since the first ugly number is already in the array) to fill the rest of the nums array with ugly numbers.
At each iteration, calculate the next ugly number by selecting the minimum of nums[i2] * 2, nums[i3] * 3, and nums[i5] * 5.
Add the selected minimum number to the nums array.
Increment the pointer (i2, i3, or i5) that corresponds to the minimum number chosen.
After the loop, return the nth element of the nums array.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen