| | | 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.MaxSumOfPairWithEqualSumOfDigits; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class MaxSumOfPairWithEqualSumOfDigits1 : IMaxSumOfPairWithEqualSumOfDigits |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int MaximumSum(int[] nums) |
| | 2 | 24 | | { |
| | 2 | 25 | | var maximumSum = -1; |
| | 2 | 26 | | var dictionary = new Dictionary<int, (int Num1, int Num2)>(); |
| | | 27 | | |
| | 24 | 28 | | foreach (var num in nums) |
| | 9 | 29 | | { |
| | 9 | 30 | | var digitSum = GetDigitSum(num); |
| | | 31 | | |
| | 9 | 32 | | if (dictionary.TryGetValue(digitSum, out var digits)) |
| | 2 | 33 | | { |
| | 2 | 34 | | var num1 = digits.Num1; |
| | 2 | 35 | | var num2 = digits.Num2; |
| | | 36 | | |
| | 2 | 37 | | if (num > digits.Num1) |
| | 1 | 38 | | { |
| | 1 | 39 | | num2 = num1; |
| | 1 | 40 | | num1 = num; |
| | 1 | 41 | | } |
| | 1 | 42 | | else if (num > num2) |
| | 1 | 43 | | { |
| | 1 | 44 | | num2 = num; |
| | 1 | 45 | | } |
| | | 46 | | |
| | 2 | 47 | | maximumSum = Math.Max(maximumSum, num1 + num2); |
| | | 48 | | |
| | 2 | 49 | | dictionary[digitSum] = (num1, num2); |
| | 2 | 50 | | } |
| | | 51 | | else |
| | 7 | 52 | | { |
| | 7 | 53 | | dictionary.Add(digitSum, (num, 0)); |
| | 7 | 54 | | } |
| | 9 | 55 | | } |
| | | 56 | | |
| | 2 | 57 | | return maximumSum; |
| | 2 | 58 | | } |
| | | 59 | | |
| | | 60 | | private static int GetDigitSum(int num) |
| | 9 | 61 | | { |
| | 9 | 62 | | var digitSum = 0; |
| | | 63 | | |
| | 26 | 64 | | while (num > 0) |
| | 17 | 65 | | { |
| | 17 | 66 | | digitSum += num % 10; |
| | | 67 | | |
| | 17 | 68 | | num /= 10; |
| | 17 | 69 | | } |
| | | 70 | | |
| | 9 | 71 | | return digitSum; |
| | 9 | 72 | | } |
| | | 73 | | } |