做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 (-1
, 1
, 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:
- 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.
- Take a small example (n = 3). What do you end up paying in the worst case?
- Check out this article if you're still stuck.
- The purely recursive implementation of minimax would be worthless for even a small n. You MUST use dynamic programming.
- 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>
这个递归用的我心服口服。。。。

핫 AI 도구

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

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

Undress AI Tool
무료로 이미지를 벗다

Clothoff.io
AI 옷 제거제

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

인기 기사

뜨거운 도구

드림위버 CS6
시각적 웹 개발 도구

SecList
SecLists는 최고의 보안 테스터의 동반자입니다. 보안 평가 시 자주 사용되는 다양한 유형의 목록을 한 곳에 모아 놓은 것입니다. SecLists는 보안 테스터에게 필요할 수 있는 모든 목록을 편리하게 제공하여 보안 테스트를 더욱 효율적이고 생산적으로 만드는 데 도움이 됩니다. 목록 유형에는 사용자 이름, 비밀번호, URL, 퍼징 페이로드, 민감한 데이터 패턴, 웹 셸 등이 포함됩니다. 테스터는 이 저장소를 새로운 테스트 시스템으로 간단히 가져올 수 있으며 필요한 모든 유형의 목록에 액세스할 수 있습니다.

맨티스BT
Mantis는 제품 결함 추적을 돕기 위해 설계된 배포하기 쉬운 웹 기반 결함 추적 도구입니다. PHP, MySQL 및 웹 서버가 필요합니다. 데모 및 호스팅 서비스를 확인해 보세요.

mPDF
mPDF는 UTF-8로 인코딩된 HTML에서 PDF 파일을 생성할 수 있는 PHP 라이브러리입니다. 원저자인 Ian Back은 자신의 웹 사이트에서 "즉시" PDF 파일을 출력하고 다양한 언어를 처리하기 위해 mPDF를 작성했습니다. HTML2FPDF와 같은 원본 스크립트보다 유니코드 글꼴을 사용할 때 속도가 느리고 더 큰 파일을 생성하지만 CSS 스타일 등을 지원하고 많은 개선 사항이 있습니다. RTL(아랍어, 히브리어), CJK(중국어, 일본어, 한국어)를 포함한 거의 모든 언어를 지원합니다. 중첩된 블록 수준 요소(예: P, DIV)를 지원합니다.

ZendStudio 13.5.1 맥
강력한 PHP 통합 개발 환경
