[Swift]LeetCode374. 猜數字大小 | Guess Number Higher or Lower

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公衆號：山青詠芝（shanqingyongzhi）
➤博客園地址：山青詠芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：http://www.javashuo.com/article/p-duahgvdr-dw.html 
➤若是連接不是山青詠芝的博客園地址，則多是爬取做者的文章。
➤原文已修改更新！強烈建議點擊原文地址閱讀！支持做者！支持原創！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

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.

---

咱們正在玩一個猜數字遊戲。 遊戲規則以下：
我從 1 到 n 選擇一個數字。 你須要猜我選擇了哪一個數字。
每次你猜錯了，我會告訴你這個數字是大了仍是小了。
你調用一個預先定義好的接口 guess(int num)，它會返回 3 個可能的結果（-1，1 或 0）：

-1 : 個人數字比較小
 1 : 個人數字比較大
 0 : 恭喜！你猜對了！

示例 :

輸入: n = 10, pick = 6
輸出: 6

---

8ms

 1 class Solution {
 2     func guessNumber(_ n: Int, _ pick: Int) -> Int {
 3         if pick == n {return n}
 4         var left:Int = 1
 5         var right:Int = n
 6         while(left < right)
 7         {
 8             var mid = left + (right - left)/2
 9             if pick == mid
10             {
11                 return mid
12             }
13             else if pick < mid
14             {
15                right = mid
16             }
17             else
18             {
19                 left = mid
20             }
21         }
22         return -1
23     }
24 }

 

---

C++版本：

 1 // Forward declaration of guess API.
 2 // @param num, your guess
 3 // @return -1 if my number is lower, 1 if my number is higher, otherwise return 0
 4 int guess(int num);
 5 
 6 class Solution {
 7 public:
 8     int guessNumber(int n) {
 9         int low=1;
10         while(low<=n){
11             int mid=low+(n-low)/2;
12             int res=guess(mid);
13             if(res==0) return mid;
14             else if(res==-1) n=mid-1;
15             else low=mid+1;
16         }
17         return -1;
18     }
19 };