264. Ugly Number II

264. Ugly Number II.java

public class Solution {
    public int nthUglyNumber(int n) {
        PriorityQueue<Long> list = new PriorityQueue<Long>();
        HashMap<Long, Integer> map = new HashMap<Long, Integer>();
        long kkk = 1;
        list.add(kkk);
        long[] nums = new long[3];
        nums[0] = 2;
        nums[1] = 3;
        nums[2] = 5;
        
        while(list.size()>0){
            long k = list.poll();
            n--;
            for(int i=0;i<3;i++){
                
               
                if(map.get(nums[i]*k)==null){
                     list.offer(nums[i] * k);
                    map.put(nums[i]*k,1);
                     //System.out.println(nums[i]*k);
                } 
               
            }
            if(n==0) return (int)k;
        }
        
        return 0;
    }
}