| | | 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.CountTheNumberOfFairPairs; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class CountTheNumberOfFairPairsBruteForce : ICountTheNumberOfFairPairs |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n^2) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums"></param> |
| | | 22 | | /// <param name="lower"></param> |
| | | 23 | | /// <param name="upper"></param> |
| | | 24 | | /// <returns></returns> |
| | | 25 | | public long CountFairPairs(int[] nums, int lower, int upper) |
| | 2 | 26 | | { |
| | 2 | 27 | | var count = 0; |
| | | 28 | | |
| | 22 | 29 | | for (var i = 0; i < nums.Length - 1; i++) |
| | 9 | 30 | | { |
| | 68 | 31 | | for (var j = i + 1; j < nums.Length; j++) |
| | 25 | 32 | | { |
| | 25 | 33 | | var sum = nums[i] + nums[j]; |
| | | 34 | | |
| | 25 | 35 | | if (lower <= sum && sum <= upper) |
| | 7 | 36 | | { |
| | 7 | 37 | | count++; |
| | 7 | 38 | | } |
| | 25 | 39 | | } |
| | 9 | 40 | | } |
| | | 41 | | |
| | 2 | 42 | | return count; |
| | 2 | 43 | | } |
| | | 44 | | } |