php教程 php手册 374&375. Guess Number Higher or Lower 1&2

374&375. Guess Number Higher or Lower 1&2

Jul 21, 2016 pm 02:52 PM

做leetcode的题

 

We are playing the Guess Game. The game is as follows:

 

I pick a number from 1 to n. You have to guess which number I picked.

Every time you guess wrong, I'll tell you whether the number is higher or lower.

You call a pre-defined API guess(int num) which returns 3 possible results (-11, or 0):

-1 : My number is lower
 1 : My number is higher
 0 : Congrats! You got it!
로그인 후 복사

Example:

n = 10, I pick 6.

Return 6.<br><br>基本就是这样:关键在于怎么找,怎么去guess;<br><br>基本点:查找/随机;(参数)递归;<br>进阶点:TLE错误解决——
로그인 후 복사

mid = (low + high) / 2;
 mid = low + (high - low) / 2;

第一种计算方法会Time Limit Exceeded,原因可能是(low + high)的结果超过int的最大范围,越界。

可以使用第一种公式,但把数据改成long型;也可以改成mid = low/2 + high/2公式。

引用自http://blog.csdn.net/y12345678904/article/details/51898958;

然后注意审题,看清楚guess和guessNum

<span style="color: #008000;">/*</span><span style="color: #008000;"> The guess API is defined in the parent class GuessGame.
   @param num, your guess
   @return -1 if my number is lower, 1 if my number is higher, otherwise return 0
      int guess(int num); </span><span style="color: #008000;">*/</span>

<span style="color: #0000ff;">public</span> <span style="color: #0000ff;">class</span> Solution <span style="color: #0000ff;">extends</span><span style="color: #000000;"> GuessGame {
    </span><span style="color: #0000ff;">public</span> <span style="color: #0000ff;">int</span> guessNumber(<span style="color: #0000ff;">int</span><span style="color: #000000;"> n) {
        </span><span style="color: #0000ff;">if</span> (guess(n)== 0) <span style="color: #0000ff;">return</span><span style="color: #000000;"> n;
        </span><span style="color: #0000ff;">int</span> left=0<span style="color: #000000;">;
        </span><span style="color: #0000ff;">int</span> right=<span style="color: #000000;">n;
        </span><span style="color: #0000ff;">while</span> (leftright) {
          <span style="color: #0000ff;">int</span> mid=left+(right-left)/2<span style="color: #000000;">;
          </span><span style="color: #0000ff;">int</span> re=<span style="color: #000000;">guess(mid);
          </span><span style="color: #0000ff;">if</span> (re==0<span style="color: #000000;">){
              </span><span style="color: #0000ff;">return</span><span style="color: #000000;"> mid;
          }</span><span style="color: #0000ff;">else</span> <span style="color: #0000ff;">if</span>(guess(mid)==-1<span style="color: #000000;">){
            right</span>=<span style="color: #000000;">mid;
          }</span><span style="color: #0000ff;">else</span><span style="color: #000000;">{
            left</span>=<span style="color: #000000;">mid;
          }
         </span><span style="color: #008000;">//</span><span style="color: #008000;"> return left;</span>
<span style="color: #000000;">        }
        </span><span style="color: #0000ff;">return</span><span style="color: #000000;"> left;
    }
}</span>
로그인 후 복사

 375. Guess Number Higher or Lower II

We are playing the Guess Game. The game is as follows:

 

I pick a number from 1 to n. You have to guess which number I picked.

Every time you guess wrong, I'll tell you whether the number I picked is higher or lower.

However, when you guess a particular number x, and you guess wrong, you pay $x. You win the game when you guess the number I picked.

Example:

n = 10, I pick 8.

First round:  You guess 5, I tell you that it's higher. You pay $5.
Second round: You guess 7, I tell you that it's higher. You pay $7.
Third round:  You guess 9, I tell you that it's lower. You pay $9.

Game over. 8 is the number I picked.

You end up paying $5 + $7 + $9 = $21.
로그인 후 복사

 

Given a particular n ≥ 1, find out how much money you need to have to guarantee a win.

Hint:

  1. The best strategy to play the game is to minimize the maximum loss you could possibly face. Another strategy is to minimize the expected loss. Here, we are interested in thefirst scenario.
  2. Take a small example (n = 3). What do you end up paying in the worst case?
  3. Check out this article if you're still stuck.
  4. The purely recursive implementation of minimax would be worthless for even a small n. You MUST use dynamic programming.
  5. As a follow-up, how would you modify your code to solve the problem of minimizing the expected loss, instead of the worst-case loss?

基本思路:最小化最大值算法;也就是求的是最大值,但是是最大值中的最小的那一个;那么逻辑应该是很清晰的,两步,找到最大值,再找最大值的最小值;

基本实现:递归;——这里特别吊的是别个用了个二维数组来比较,用二维数组的序号/位置,来分析n个数的情况——http://www.cnblogs.com/neweracoding/p/5679936.html;

<span style="color: #0000ff;">public</span> <span style="color: #0000ff;">class</span><span style="color: #000000;"> Solution {
  </span><span style="color: #0000ff;">public</span> <span style="color: #0000ff;">int</span> getMoneyAmount(<span style="color: #0000ff;">int</span><span style="color: #000000;"> n) {
    </span><span style="color: #0000ff;">int</span>[][] table = <span style="color: #0000ff;">new</span> <span style="color: #0000ff;">int</span>[n + 1][n + 1<span style="color: #000000;">];  //0
    </span><span style="color: #0000ff;">return</span> payForRange(table, 1<span style="color: #000000;">, n);
  }

  </span><span style="color: #008000;">//</span><span style="color: #008000;">return the amount paid for the game within range [start,end]</span>
  <span style="color: #0000ff;">private</span> <span style="color: #0000ff;">int</span> payForRange(<span style="color: #0000ff;">int</span>[][] dp, <span style="color: #0000ff;">int</span> start, <span style="color: #0000ff;">int</span><span style="color: #000000;"> end) {
    </span><span style="color: #0000ff;">if</span> (start >=<span style="color: #000000;"> end)
      </span><span style="color: #0000ff;">return</span> 0<span style="color: #000000;">;
    </span><span style="color: #0000ff;">if</span> (dp[start][end] != 0<span style="color: #000000;">)
      </span><span style="color: #0000ff;">return</span><span style="color: #000000;"> dp[start][end];

    </span><span style="color: #0000ff;">int</span> minimumForCurrentRange =<span style="color: #000000;"> Integer.MAX_VALUE;
    </span><span style="color: #0000ff;">for</span> (<span style="color: #0000ff;">int</span> x = start; x x) {
      <span style="color: #008000;">//</span><span style="color: #008000;">calculate the amount to pay if pick x.</span>
      <span style="color: #0000ff;">int</span> pay = x + Math.max(payForRange(dp, start, x - 1), payForRange(dp, x + 1<span style="color: #000000;">, end));
      </span><span style="color: #008000;">//</span><span style="color: #008000;">calculate min of maxes</span>
      minimumForCurrentRange =<span style="color: #000000;"> Math.min(minimumForCurrentRange, pay);
    }

    dp[start][end] </span>=<span style="color: #000000;"> minimumForCurrentRange;
    </span><span style="color: #0000ff;">return</span><span style="color: #000000;"> minimumForCurrentRange;
  }
}</span>
로그인 후 복사

 

这个递归用的我心服口服。。。。

 

본 웹사이트의 성명
본 글의 내용은 네티즌들의 자발적인 기여로 작성되었으며, 저작권은 원저작자에게 있습니다. 본 사이트는 이에 상응하는 법적 책임을 지지 않습니다. 표절이나 침해가 의심되는 콘텐츠를 발견한 경우 admin@php.cn으로 문의하세요.

핫 AI 도구

Undresser.AI Undress

Undresser.AI Undress

사실적인 누드 사진을 만들기 위한 AI 기반 앱

AI Clothes Remover

AI Clothes Remover

사진에서 옷을 제거하는 온라인 AI 도구입니다.

Undress AI Tool

Undress AI Tool

무료로 이미지를 벗다

Clothoff.io

Clothoff.io

AI 옷 제거제

AI Hentai Generator

AI Hentai Generator

AI Hentai를 무료로 생성하십시오.

인기 기사

R.E.P.O. 에너지 결정과 그들이하는 일 (노란색 크리스탈)
3 몇 주 전 By 尊渡假赌尊渡假赌尊渡假赌
R.E.P.O. 최고의 그래픽 설정
3 몇 주 전 By 尊渡假赌尊渡假赌尊渡假赌
R.E.P.O. 아무도들을 수없는 경우 오디오를 수정하는 방법
3 몇 주 전 By 尊渡假赌尊渡假赌尊渡假赌
WWE 2K25 : Myrise에서 모든 것을 잠금 해제하는 방법
3 몇 주 전 By 尊渡假赌尊渡假赌尊渡假赌

뜨거운 도구

메모장++7.3.1

메모장++7.3.1

사용하기 쉬운 무료 코드 편집기

SublimeText3 중국어 버전

SublimeText3 중국어 버전

중국어 버전, 사용하기 매우 쉽습니다.

스튜디오 13.0.1 보내기

스튜디오 13.0.1 보내기

강력한 PHP 통합 개발 환경

드림위버 CS6

드림위버 CS6

시각적 웹 개발 도구

SublimeText3 Mac 버전

SublimeText3 Mac 버전

신 수준의 코드 편집 소프트웨어(SublimeText3)