| | | 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.SecondLargestDigitInString; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class SecondLargestDigitInStringIterative : ISecondLargestDigitInString |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="s"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int SecondHighest(string s) |
| | 3 | 24 | | { |
| | 3 | 25 | | var highest = -1; |
| | 3 | 26 | | var secondHighest = -1; |
| | | 27 | | |
| | 55 | 28 | | foreach (var c in s) |
| | 23 | 29 | | { |
| | 23 | 30 | | if (!char.IsDigit(c)) |
| | 11 | 31 | | { |
| | 11 | 32 | | continue; |
| | | 33 | | } |
| | | 34 | | |
| | 12 | 35 | | var num = c - '0'; |
| | | 36 | | |
| | 12 | 37 | | if (num > highest) |
| | 6 | 38 | | { |
| | 6 | 39 | | secondHighest = highest; |
| | 6 | 40 | | highest = num; |
| | 6 | 41 | | } |
| | 6 | 42 | | else if (num > secondHighest && num < highest) |
| | 0 | 43 | | { |
| | 0 | 44 | | secondHighest = num; |
| | 0 | 45 | | } |
| | 12 | 46 | | } |
| | | 47 | | |
| | 3 | 48 | | return secondHighest; |
| | 3 | 49 | | } |
| | | 50 | | } |