g0701_0800.s0763_partition_labels.Solution.dart Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

// #Medium #String #Hash_Table #Greedy #Two_Pointers #Data_Structure_II_Day_7_String
// #Big_O_Time_O(n)_Space_O(1) #2024_10_12_Time_311_ms_(100.00%)_Space_145.8_MB_(100.00%)

class Solution {
  List partitionLabels(String s) {
    List result = [];
    List position = List.filled(26, 0);

    // Store the last position of each letter in the string
    for (int i = 0; i < s.length; i++) {
      position[s.codeUnitAt(i) - 'a'.codeUnitAt(0)] = i;
    }

    int i = 0;
    int prev = -1;
    int max = 0;

    while (i < s.length) {
      max = max > position[s.codeUnitAt(i) - 'a'.codeUnitAt(0)] ? max : position[s.codeUnitAt(i) - 'a'.codeUnitAt(0)];

      if (i == max) {
        result.add(i - prev);
        prev = i;
      }

      i++;
    }

    return result;
  }
}