Can anyone give a solution sketch for this problem? I've been stuck on it for a while and cannot find a solution online. Thanks!
# | User | Rating |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
2 | awoo | 163 |
4 | TheScrasse | 154 |
5 | nor | 153 |
6 | maroonrk | 152 |
6 | -is-this-fft- | 152 |
8 | Petr | 145 |
9 | pajenegod | 144 |
9 | orz | 144 |
Can anyone give a solution sketch for this problem? I've been stuck on it for a while and cannot find a solution online. Thanks!
Given a string a and b that consist of exactly the same characters, determine the minimum “cuts” required on string a such that it is possible to rearrange the segments of string a to match string b,
For instance, if a = “xxyyz” and b = “zxyxy”, the minimum cuts required on string a is 3
Illustration: x | xy | y | z --> z-xy-x-y
Constraints: |a| = |b| <= 20.
Time limit: 1 second
Name |
---|