鍓戞寚offer 33.涓戞暟

Posted 2020-11-26

鏍囩锛?a href='http://www.mamicode.com/so/1/ret' title='ret'>ret   solution   off   turn   璁板綍   棰樼洰   椤哄簭   

鍓戞寚offer 33.涓戞暟

棰樼洰

鎶婂彧鍖呭惈璐ㄥ洜瀛?銆?鍜?鐨勬暟绉颁綔涓戞暟锛圲gly Number锛夈€備緥濡?銆?閮芥槸涓戞暟锛屼絾14涓嶆槸锛屽洜涓哄畠鍖呭惈璐ㄥ洜瀛?銆?涔犳儻涓婃垜浠妸1褰撳仛鏄涓€涓笐鏁般€傛眰鎸変粠灏忓埌澶х殑椤哄簭鐨勭N涓笐鏁般€?/p>

鎬濊矾

杩欓噷閲囩敤鐨勬槸涓夋寚閽堟硶锛屼换鎰忎笐鏁伴兘鏄瘮杩欎釜鏁板皬鐨勪笐鏁颁箻浠?锛?锛?鍏朵腑涔嬩竴寰楀埌鐨勶紝瑕佹眰鎸夌収椤哄簭鎺掑垪锛岄偅涔堝氨浠庝箣鍓嶇殑鏁颁腑鎵惧埌鏈浣跨敤杩囩殑鏁颁箻涓€涓嬶紝鐒跺悗姣旇緝锛屽氨鍙互寰楀埌鏂扮殑鏁颁簡銆?br /> 棣栧厛鍒濆浣嶄负1锛岃涓変釜鎸囬拡鍊糿2,n3,n5,鍒濆璁句负0.涔嬪悗寮€濮嬪惊鐜紝姣忔寰幆閮芥壘鍒?35鏈箻杩囩殑鏁板瓧涔樹竴涓嬶紝鐒跺悗鍙栨渶灏忓€间负鏂扮殑涓戞暟銆備箣鍚庯紝鑻2n3n5浣跨敤杩囦簡锛岄偅涔堟寚閽堜綅+1锛屼笅娆′箻涓嬩竴涓暟瀛楋紝濡傛灉閮藉彲浠ワ紝閭ｅ氨閮藉姞銆傛妸鏁板瓧璁板綍涓嬫潵鏈€鍚庤緭鍑哄嵆鍙€?/p>

浠ｇ爜

  public int GetUglyNumber_Solution(int index) {
    if(index==0){
      return 0;
    }
    int[] ans = new int[index];
    int n2 = 0, n3 = 0, n5 = 0;
    ans[0] = 1;
    for (int i = 1; i < index; i++) {
      int min = Math.min(ans[n2] * 2, Math.min(ans[n3] * 3, ans[n5] * 5));
      ans[i] = min;
      if (min == ans[n2]*2) {
        n2++;
      }
      if (min == ans[n3]*3) {
        n3++;
      }
      if (min == ans[n5]*5) {
        n5++;
      }

    }
    return ans[index-1];
  }