| | | 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.PlusOne; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class PlusOneIncrementDigitArray : IPlusOne |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="digits"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int[] PlusOne(int[] digits) |
| | 7 | 24 | | { |
| | 7 | 25 | | var carryDigit = 0; |
| | | 26 | | |
| | 7 | 27 | | digits[^1] += 1; |
| | | 28 | | |
| | 26 | 29 | | for (var index = digits.Length - 1; index >= 0; index--) |
| | 11 | 30 | | { |
| | 11 | 31 | | if (digits[index] + carryDigit > 9) |
| | 6 | 32 | | { |
| | 6 | 33 | | digits[index] = 0; |
| | 6 | 34 | | carryDigit = 1; |
| | 6 | 35 | | } |
| | | 36 | | else |
| | 5 | 37 | | { |
| | 5 | 38 | | digits[index] += carryDigit; |
| | 5 | 39 | | carryDigit = 0; |
| | 5 | 40 | | break; |
| | | 41 | | } |
| | 6 | 42 | | } |
| | | 43 | | |
| | 7 | 44 | | return carryDigit > 0 ? digits.Prepend(carryDigit).ToArray() : digits; |
| | 7 | 45 | | } |
| | | 46 | | } |