| | | 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.FindThePunishmentNumberOfInteger; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class FindThePunishmentNumberOfIntegerRecursive : IFindThePunishmentNumberOfInteger |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n * 2^(log10 n)) |
| | | 19 | | /// Space complexity - O(log10 n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="n"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int PunishmentNumber(int n) |
| | 2 | 24 | | { |
| | 2 | 25 | | var punishmentNumber = 0; |
| | | 26 | | |
| | 98 | 27 | | for (var i = 1; i <= n; i++) |
| | 47 | 28 | | { |
| | 47 | 29 | | var square = i * i; |
| | 47 | 30 | | var squareStr = square.ToString(); |
| | | 31 | | |
| | 47 | 32 | | if (CanPartitionToSum(squareStr, 0, i, 0)) |
| | 7 | 33 | | { |
| | 7 | 34 | | punishmentNumber += square; |
| | 7 | 35 | | } |
| | 47 | 36 | | } |
| | | 37 | | |
| | 2 | 38 | | return punishmentNumber; |
| | 2 | 39 | | } |
| | | 40 | | |
| | | 41 | | private static bool CanPartitionToSum(string s, int index, int target, int currentSum) |
| | 190 | 42 | | { |
| | 190 | 43 | | if (index == s.Length) |
| | 49 | 44 | | { |
| | 49 | 45 | | return currentSum == target; |
| | | 46 | | } |
| | | 47 | | |
| | 141 | 48 | | var num = 0; |
| | | 49 | | |
| | 542 | 50 | | for (var i = index; i < s.Length; i++) |
| | 229 | 51 | | { |
| | 229 | 52 | | num = (num * 10) + (s[i] - '0'); |
| | | 53 | | |
| | 229 | 54 | | if (currentSum + num > target) |
| | 86 | 55 | | { |
| | 86 | 56 | | break; |
| | | 57 | | } |
| | | 58 | | |
| | 143 | 59 | | if (CanPartitionToSum(s, i + 1, target, currentSum + num)) |
| | 13 | 60 | | { |
| | 13 | 61 | | return true; |
| | | 62 | | } |
| | 130 | 63 | | } |
| | | 64 | | |
| | 128 | 65 | | return false; |
| | 190 | 66 | | } |
| | | 67 | | } |