package com.fishercoder.solutions;

import java.util.ArrayList;
import java.util.List;

/**
 * 763. Partition Labels
 *
 * A string S of lowercase letters is given.
 * We want to partition this string into as many parts as possible so that each letter appears
 * in at most one part, and return a list of integers representing the size of these parts.

 Example 1:
 Input: S = "ababcbacadefegdehijhklij"
 Output: [9,7,8]
 Explanation:
 The partition is "ababcbaca", "defegde", "hijhklij".
 This is a partition so that each letter appears in at most one part.
 A partition like "ababcbacadefegde", "hijhklij" is incorrect, because it splits S into less parts.

 Note:
 S will have length in range [1, 500].
 S will consist of lowercase letters ('a' to 'z') only.
 */
public class _763 {

  public static class Solution1 {
    public List<Integer> partitionLabels(String S) {
      List<Integer> result = new ArrayList<>();
      int[] last = new int[26];
      /**This is the key step:
       * we find the last occurrence of each letter and record them in last[]*/
      for (int i = 0; i < S.length(); i++) {
        last[S.charAt(i) - 'a'] = i;
      }
      int start = -1;
      int end = -1;
      for (int i = 0; i < S.length(); i++) {
        if (start == -1) {
          start = i;
        }
        end = Math.max(end, last[S.charAt(i) - 'a']);
        if (end == i) {
          result.add(end - start + 1);
          start = -1;
        }
      }
      return result;
    }
  }

}

@@ -1158,22 +1158,81 @@
     
-int start = -1
+/**record the last end index of the current substring*/%0A      int end = 0
 ;%0A  
@@ -1243,16 +1243,17 @@
 int 
-end = -1
+start = 0
 ;%0A  
@@ -1299,66 +1299,8 @@
 ) %7B%0A
-        if (start == -1) %7B%0A          start = i;%0A        %7D%0A
     
@@ -1430,17 +1430,22 @@
 start = 
--
+end + 
 1;%0A     

refactor 763