| | | 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.MaximumCountOfPositiveIntegerAndNegativeInteger; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class MaximumCountOfPositiveIntegerAndNegativeIntegerBinarySearch : |
| | | 16 | | IMaximumCountOfPositiveIntegerAndNegativeInteger |
| | | 17 | | { |
| | | 18 | | /// <summary> |
| | | 19 | | /// Time complexity - O(log n) |
| | | 20 | | /// Space complexity - O(1) |
| | | 21 | | /// </summary> |
| | | 22 | | /// <param name="nums"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int MaximumCount(int[] nums) |
| | 3 | 25 | | { |
| | 3 | 26 | | var negativeCount = FindFirstIndex(nums, 0); |
| | 3 | 27 | | var positiveCount = nums.Length - FindFirstIndex(nums, 1); |
| | | 28 | | |
| | 3 | 29 | | return Math.Max(negativeCount, positiveCount); |
| | 3 | 30 | | } |
| | | 31 | | |
| | | 32 | | private static int FindFirstIndex(int[] nums, int target) |
| | 6 | 33 | | { |
| | 6 | 34 | | var left = 0; |
| | 6 | 35 | | var right = nums.Length; |
| | | 36 | | |
| | 24 | 37 | | while (left < right) |
| | 18 | 38 | | { |
| | 18 | 39 | | var mid = left + ((right - left) / 2); |
| | | 40 | | |
| | 18 | 41 | | if (nums[mid] < target) |
| | 8 | 42 | | { |
| | 8 | 43 | | left = mid + 1; |
| | 8 | 44 | | } |
| | | 45 | | else |
| | 10 | 46 | | { |
| | 10 | 47 | | right = mid; |
| | 10 | 48 | | } |
| | 18 | 49 | | } |
| | | 50 | | |
| | 6 | 51 | | return left; |
| | 6 | 52 | | } |
| | | 53 | | } |