| | | 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 MaxSumOfPairWithEqualSumOfDigitsDictionary : IMaxSumOfPairWithEqualSumOfDigits |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 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 maxNums = new int[82]; |
| | 2 | 27 | | var secondMaxNums = new int[82]; |
| | | 28 | | |
| | 24 | 29 | | foreach (var num in nums) |
| | 9 | 30 | | { |
| | 9 | 31 | | var digitSum = GetDigitSum(num); |
| | | 32 | | |
| | 9 | 33 | | if (num > maxNums[digitSum]) |
| | 8 | 34 | | { |
| | 8 | 35 | | secondMaxNums[digitSum] = maxNums[digitSum]; |
| | 8 | 36 | | maxNums[digitSum] = num; |
| | 8 | 37 | | } |
| | 1 | 38 | | else if (num > secondMaxNums[digitSum]) |
| | 1 | 39 | | { |
| | 1 | 40 | | secondMaxNums[digitSum] = num; |
| | 1 | 41 | | } |
| | | 42 | | |
| | 9 | 43 | | if (secondMaxNums[digitSum] > 0) |
| | 2 | 44 | | { |
| | 2 | 45 | | maximumSum = Math.Max(maximumSum, maxNums[digitSum] + secondMaxNums[digitSum]); |
| | 2 | 46 | | } |
| | 9 | 47 | | } |
| | | 48 | | |
| | 2 | 49 | | return maximumSum; |
| | 2 | 50 | | } |
| | | 51 | | |
| | | 52 | | private static int GetDigitSum(int num) |
| | 9 | 53 | | { |
| | 9 | 54 | | var digitSum = 0; |
| | | 55 | | |
| | 26 | 56 | | while (num > 0) |
| | 17 | 57 | | { |
| | 17 | 58 | | digitSum += num % 10; |
| | | 59 | | |
| | 17 | 60 | | num /= 10; |
| | 17 | 61 | | } |
| | | 62 | | |
| | 9 | 63 | | return digitSum; |
| | 9 | 64 | | } |
| | | 65 | | } |