动态规划丑数二

class Solution {
    public int nthUglyNumber(int n) {
    	int ans[]=new int[n],count=1,index2=0,index3=0,index5=0;
    	ans[0]=1;
    	while(count

你可能感兴趣的:(DP)