Commit 849b5d2

committed

docs: add 763. Partition Labels

1 parent cb78d3d commit 849b5d2Copy full SHA for 849b5d2

File tree

+33

-0

lines changed

+33

-0

lines changed

Lines changed: 33 additions & 0 deletions

Original file line number	Diff line number	Diff line change
@@ -2256,6 +2256,39 @@ Put the code below in main.rs and run `cargo run`
`2256`	`2256`	`println!("result: {:?}", result);`
`2257`	`2257`	```
`2258`	`2258`
	`2259`	`+# 763. Partition Labels`
	`2260`	`+`
	`2261`	`+## Description`
	`2262`	`+`
	`2263`	+A string `s` of lowercase English 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.
	`2264`	`+`
	`2265`	`+## Examples`
	`2266`	`+`
	`2267`	+```text
	`2268`	`+Example 1:`
	`2269`	`+`
	`2270`	`+Input: s = "ababcbacadefegdehijhklij"`
	`2271`	`+Output: [9,7,8]`
	`2272`	`+Explanation:`
	`2273`	`+The partition is "ababcbaca", "defegde", "hijhklij".`
	`2274`	`+This is a partition so that each letter appears in at most one part.`
	`2275`	`+A partition like "ababcbacadefegde", "hijhklij" is incorrect, because it splits s into less parts.`
	`2276`	`+Example 2:`
	`2277`	`+`
	`2278`	`+Input: s = "eccbbbbdec"`
	`2279`	`+Output: [10]`
	`2280`	+```
	`2281`	`+`
	`2282`	`+## How to Run in main.rs`
	`2283`	`+`
	`2284`	+Put the code below in main.rs and run `cargo run`
	`2285`	`+`
	`2286`	+```rust
	`2287`	`+ let s = String::from("ababcbacadefegdehijhklij");`
	`2288`	`+ let result = leetcode::medium::partition_labels::partition_labels(s);`
	`2289`	`+ println!("result: {:?}", result);`
	`2290`	+```
	`2291`	`+`
`2259`	`2292`	`# 846. Hand of Straights`
`2260`	`2293`
`2261`	`2294`	`## Description`

Comments

(0)