comefrom: <awangdev>Ugly Number II_1.java
code: public int nthUglyNumber(int n) {
          if (n <= 1) return n;
          int[] dp = new int[n];
          dp[0] = 1;
          int index2 = 0, index3 = 0, index5 = 0;
          int factor2 = 2, factor3 = 3, factor5 = 5;
          for (int i = 1; i < n; i++){
              int min = Math.min(Math.min(factor2, factor3), factor5);
              dp[i] = min;
              if (factor2 == min) factor2 = dp[++index2] * 2;
              if (factor3 == min) factor3 = dp[++index3] * 3;
              if (factor5 == min) factor5 = dp[++index5] * 5;
          }
          return dp[n-1];
      }
masked: public int sample_funcname ( int var_0 ) {
    if ( var_0 <= 1 ) return var_0 ;
    int [ ] var_1 = new int [ var_0 ] ;
    var_1 [ 0 ] = 1 ;
    int var_2 = 0 , var_3 = 0 , var_4 = 0 ;
    int var_5 = 2 , var_6 = 3 , var_7 = 5 ;
    for ( int var_8 = 1 ;
    var_8 < var_0 ;
    var_8 ++ ) {
      int min = Math . min ( Math . min ( var_5 , var_6 ) , var_7 ) ;
      var_1 [ var_8 ] = min ;
      if ( var_5 == min ) var_5 = var_1 [ ++ var_2 ] * 2 ;
      if ( var_6 == min ) var_6 = var_1 [ ++ var_3 ] * 3 ;
      if ( var_7 == min ) var_7 = var_1 [ ++ var_4 ] * 5 ;
    }
    return var_1 [ var_0 - 1 ] ;
  }
  