[LeetCode] 763. Partition Labels - 문제풀이 Description 문자열을 가능한 한 많은 부분으로 분할하여 각 문자가 한 부분에만 표시되도록 나눈 뒤 해당 인덱스를 반환하는 문제입니다. You are given a string s. We want to partition the string into as many parts as possible so that each letter appears in at most one part. Note that the partition is done so that after concatenating all the parts in order, the resultant string should be s. Return a list of integers representing the size of these parts.. 알고리즘/LeetCode 2022. 3. 21. 22:12
