Guess Number Higher or Lower - String - Easy - LeetCode
💻 coding

Guess Number Higher or Lower - String - Easy - LeetCode

1 min read 260 words
1 min read
ShareWhatsAppPost on X
  • 1The Guess Game involves guessing a number between 1 and n, with feedback on whether the guess is too high or too low.
  • 2The solution uses a binary search algorithm, achieving a time complexity of O(log n) and a space complexity of O(1).
  • 3The guess API provides three possible responses: -1 for lower, 1 for higher, and 0 for correct guesses.

AI-generated summary · May not capture all nuances

Key Insight
AskGif

"The Guess Game involves guessing a number between 1 and n, with feedback on whether the guess is too high or too low."

Guess Number Higher or Lower - String - Easy - 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 will tell you whether the number I picked is higher or lower than your guess.

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

-1: The number I picked is lower than your guess (i.e. pick < num). 1: The number I picked is higher than your guess (i.e. pick > num). 0: The number I picked is equal to your guess (i.e. pick == num). Return the number that I picked.

Example 1:

Input: n = 10, pick = 6 Output: 6 Example 2:

Input: n = 1, pick = 1 Output: 1 Example 3:

Input: n = 2, pick = 1 Output: 1 Example 4:

Input: n = 2, pick = 2 Output: 2

Constraints:

1 <= n <= 231 - 1 1 <= pick <= n

/** 
 * Forward declaration of guess API.
 * @param num your guess
 * @return 	 -1 if num is lower than the guess number
 *			 1 if num is higher than the guess number
 * otherwise return 0
 * int guess(int num);
 */

public class Solution : GuessGame {
 public int GuessNumber(int n) {
 int low = 1;
 int high = n;
 while(low<high){
 int mid = low + (high-low)/2; 
 if(guess(mid)>0){
 low = mid+1;
 }
 else if(guess(mid)<0){
 high = mid;
 }
 else{
 return mid;
 }
 }
 return low;
 }
}

Time Complexity: O(logn)

Space Complexity: O(1)

Enjoyed this article?

Share it with someone who'd find it useful.

ShareWhatsAppPost on X

sumitc91

Published on 3 October 2020 · 1 min read · 260 words

Part of AskGif Blog · coding

You might also like