| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | | 3 | | // All Rights Reserved. |
| | | 4 | | // -------------------------------------------------------------------------------- |
| | | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | | 9 | | // known as Yevhenii Yeriemeieiv). |
| | | 10 | | // -------------------------------------------------------------------------------- |
| | | 11 | | |
| | | 12 | | namespace LeetCode.Algorithms.GuessNumberHigherOrLower; |
| | | 13 | | |
| | | 14 | | public class GuessNumberHigherOrLowerBinarySearch : GuessNumberHigherOrLower |
| | | 15 | | { |
| | 3 | 16 | | public GuessNumberHigherOrLowerBinarySearch(int pickedNumber) : base(pickedNumber) |
| | 3 | 17 | | { |
| | 3 | 18 | | } |
| | | 19 | | |
| | | 20 | | /// <summary> |
| | | 21 | | /// Time complexity - O(log n) |
| | | 22 | | /// Space complexity - O(1) |
| | | 23 | | /// </summary> |
| | | 24 | | /// <param name="n"></param> |
| | | 25 | | /// <returns></returns> |
| | | 26 | | public override int GuessNumber(int n) |
| | 3 | 27 | | { |
| | 3 | 28 | | var left = 1; |
| | 3 | 29 | | var right = n; |
| | | 30 | | int num; |
| | | 31 | | |
| | | 32 | | do |
| | 5 | 33 | | { |
| | 5 | 34 | | num = left + ((right - left) / 2); |
| | | 35 | | |
| | 5 | 36 | | var result = guess(num); |
| | | 37 | | |
| | 5 | 38 | | if (result == 0) |
| | 3 | 39 | | { |
| | 3 | 40 | | break; |
| | | 41 | | } |
| | | 42 | | |
| | 2 | 43 | | if (result > 0) |
| | 1 | 44 | | { |
| | 1 | 45 | | left = num + 1; |
| | 1 | 46 | | } |
| | | 47 | | else |
| | 1 | 48 | | { |
| | 1 | 49 | | right = num - 1; |
| | 1 | 50 | | } |
| | 4 | 51 | | } while (left <= right); |
| | | 52 | | |
| | 3 | 53 | | return num; |
| | 3 | 54 | | } |
| | | 55 | | } |