Merge pull request 6boris#241 from 0xff-dev/763

Add solution and test-cases for problem 763

Author: 6boris

leetcode/701-800/0763.Partition-Labels/README.md

@@ -1,28 +1,29 @@
 # [763.Partition Labels][title]
 
-> [!WARNING|style:flat]
-> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
-
 ## 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.
 
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+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.
 ```
 
-## 题意
-> ...
+**Example 2:**
 
-## 题解
-
-### 思路1
-> ...
-Partition Labels
-```go
 ```
-
+Input: s = "eccbbbbdec"
+Output: [10]
+```
 
 ## 结语
 

leetcode/701-800/0763.Partition-Labels/Solution.go

@@ -1,5 +1,23 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(s string) []int {
+	partLength := make([]int, 0)
+	charsLastIndex := make([]int, 26)
+	for idx, b := range s {
+		charsLastIndex[b-'a'] = idx
+	}
+
+	lastIdx, length := -1, 0
+	for idx := 0; idx < len(s); idx++ {
+		if charsLastIndex[s[idx]-'a'] > lastIdx {
+			lastIdx = charsLastIndex[s[idx]-'a']
+		}
+		if idx == lastIdx {
+			partLength = append(partLength, length+1)
+			length = 0
+			continue
+		}
+		length++
+	}
+	return partLength
 }

leetcode/701-800/0763.Partition-Labels/Solution_test.go

@@ -10,12 +10,13 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		inputs string
+		expect []int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", "ababcbacadefegdehijhklij", []int{9, 7, 8}},
+		{"TestCase2", "eccbbbbdec", []int{10}},
+		{"TestCase3", "abc", []int{1, 1, 1}},
+		{"TestCase4", "aabbadec", []int{5, 1, 1, 1}},
 	}
 
 	//	开始测试