| | | 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.PartitionLabels; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class PartitionLabelsTwoPointers : IPartitionLabels |
| | | 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 IList<int> PartitionLabels(string s) |
| | 2 | 24 | | { |
| | 2 | 25 | | var lastIndex = new int[26]; |
| | | 26 | | |
| | 72 | 27 | | for (var i = 0; i < s.Length; i++) |
| | 34 | 28 | | { |
| | 34 | 29 | | lastIndex[s[i] - 'a'] = i; |
| | 34 | 30 | | } |
| | | 31 | | |
| | 2 | 32 | | var result = new List<int>(); |
| | | 33 | | |
| | 2 | 34 | | var start = 0; |
| | 2 | 35 | | var end = 0; |
| | | 36 | | |
| | 72 | 37 | | for (var i = 0; i < s.Length; i++) |
| | 34 | 38 | | { |
| | 34 | 39 | | end = Math.Max(end, lastIndex[s[i] - 'a']); |
| | | 40 | | |
| | 34 | 41 | | if (i != end) |
| | 30 | 42 | | { |
| | 30 | 43 | | continue; |
| | | 44 | | } |
| | | 45 | | |
| | 4 | 46 | | result.Add(end - start + 1); |
| | | 47 | | |
| | 4 | 48 | | start = i + 1; |
| | 4 | 49 | | } |
| | | 50 | | |
| | 2 | 51 | | return result; |
| | 2 | 52 | | } |
| | | 53 | | } |