Add solution 0791

This commit is contained in:
YDZ
2021-07-13 21:21:21 +08:00
parent 41b03831b3
commit eda4953c3d
7 changed files with 180 additions and 5 deletions

View File

@ -0,0 +1,15 @@
package leetcode
import "sort"
func customSortString(order string, str string) string {
magic := map[byte]int{}
for i := range order {
magic[order[i]] = i - 30
}
byteSlice := []byte(str)
sort.Slice(byteSlice, func(i, j int) bool {
return magic[byteSlice[i]] < magic[byteSlice[j]]
})
return string(byteSlice)
}

View File

@ -0,0 +1,43 @@
package leetcode
import (
"fmt"
"testing"
)
type question791 struct {
para791
ans791
}
// para 是参数
// one 代表第一个参数
type para791 struct {
order string
str string
}
// ans 是答案
// one 代表第一个答案
type ans791 struct {
one string
}
func Test_Problem791(t *testing.T) {
qs := []question791{
{
para791{"cba", "abcd"},
ans791{"cbad"},
},
}
fmt.Printf("------------------------Leetcode Problem 791------------------------\n")
for _, q := range qs {
_, p := q.ans791, q.para791
fmt.Printf("【input】:%v 【output】:%v\n", p, customSortString(p.order, p.str))
}
fmt.Printf("\n\n\n")
}

View File

@ -0,0 +1,55 @@
# [791. Custom Sort String](https://leetcode.com/problems/custom-sort-string/)
## 题目
`order` and `str` are strings composed of lowercase letters. In `order`, no letter occurs more than once.
`order` was sorted in some custom order previously. We want to permute the characters of `str` so that they match the order that `order` was sorted. More specifically, if `x` occurs before `y` in `order`, then `x` should occur before `y` in the returned string.
Return any permutation of `str` (as a string) that satisfies this property.
```
Example:Input:
order = "cba"
str = "abcd"
Output: "cbad"
Explanation:
"a", "b", "c" appear in order, so the order of "a", "b", "c" should be "c", "b", and "a".
Since "d" does not appear in order, it can be at any position in the returned string. "dcba", "cdba", "cbda" are also valid outputs.
```
**Note:**
- `order` has length at most `26`, and no character is repeated in `order`.
- `str` has length at most `200`.
- `order` and `str` consist of lowercase letters only.
## 题目大意
字符串 S 和 T 只包含小写字符。在 S 中所有字符只会出现一次。S 已经根据某种规则进行了排序。我们要根据 S 中的字符顺序对 T 进行排序。更具体地说,如果 S 中 x 在 y 之前出现,那么返回的字符串中 x 也应出现在 y 之前。返回任意一种符合条件的字符串 T。
## 解题思路
- 题目只要求 T 中包含 S 的字符串有序,所以可以先将 T 中包含 S 的字符串排好序然后再拼接上其他字符。S 字符串最长为 26 位,先将 S 中字符的下标向左偏移 30并将偏移后的下标值存入字典中。再把 T 字符串按照字典中下标值进行排序。S 中出现的字符对应的下标经过处理以后变成了负数S 中未出现的字符的下标还是正数。所以经过排序以后S 中出现的字符按照原有顺序排列在前面S 中未出现的字符依次排在后面。
## 代码
```go
package leetcode
import "sort"
func customSortString(order string, str string) string {
magic := map[byte]int{}
for i := range order {
magic[order[i]] = i - 30
}
byteSlice := []byte(str)
sort.Slice(byteSlice, func(i, j int) bool {
return magic[byteSlice[i]] < magic[byteSlice[j]]
})
return string(byteSlice)
}
```

View File

@ -2,12 +2,12 @@ package leetcode
func maximumElementAfterDecrementingAndRearranging(arr []int) int {
n := len(arr)
cnt := make([]int, n+1)
count := make([]int, n+1)
for _, v := range arr {
cnt[min(v, n)]++
count[min(v, n)]++
}
miss := 0
for _, c := range cnt[1:] {
for _, c := range count[1:] {
if c == 0 {
miss++
} else {