丑数_33

public int GetUglyNumber_Solution(int index) {
        if (index<7){
            return index;
        }
        int[] res=new int[index];
        res[0]=1;
        List<Integer> l2=new LinkedList<>();
        List<Integer> l3=new LinkedList<>();
        List<Integer> l5=new LinkedList<>();
        int currIndex=1;
        while (currIndex<index){
            //上一个数的值
            int last=res[currIndex-1];
            l2.add(last*2);
            l3.add(last*3);
            l5.add(last*5);

            int tempMinValue=Math.min(l2.get(0),Math.min(l3.get(0),l5.get(0)));
            if (l2.get(0)==tempMinValue){
                res[currIndex]=l2.remove(0);
            }

            if (l3.get(0)==tempMinValue){
                res[currIndex]=l3.remove(0);
            }

            if (l5.get(0)==tempMinValue){
                res[currIndex]=l5.remove(0);
            }
            currIndex++;
        }
        return res[index-1];
    }

  public int GetUglyNumber_Solution(int index) {
        if(index<7) return index;
        ArrayList<Integer> list=new ArrayList<Integer>();
        list.add(1);
        int i2=0,i3=0,i5=0;
        while (list.size()<index){
            int min = Math.min(Math.min(list.get(i2)*2, list.get(i3)*3), list.get(i5)*5);
            list.add(min);
            if (min==list.get(i2)*2){
                i2++;
            }
            if (min==list.get(i3)*3){
                i3++;
            }
            if (min==list.get(i5)*5){
                i5++;
            }
        }
        return list.get(list.size()-1);
    }