Commit f467f1e

committed

add 354

1 parent 8f504fc commit f467f1eCopy full SHA for f467f1e

File tree

+76

-0

lines changed

+76

-0

lines changed

Lines changed: 37 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,37 @@`
	`1`	`+`
	`2`	`+# 0354.russian-doll-envelopes`
	`3`	`+`
	`4`	+```text
	`5`	`+354. 俄罗斯套娃信封问题`
	`6`	`+`
	`7`	`+给你一个二维整数数组 envelopes ,其中 envelopes[i] = [wi, hi] ,表示第 i 个信封的宽度和高度。`
	`8`	`+`
	`9`	`+当另一个信封的宽度和高度都比这个信封大的时候,这个信封就可以放进另一个信封里,如同俄罗斯套娃一样。`
	`10`	`+`
	`11`	`+请计算最多能有多少个信封能组成一组"俄罗斯套娃"信封(即可以把一个信封放到另一个信封里面)。`
	`12`	`+`
	`13`	`+注意:不允许旋转信封。`
	`14`	`+`
	`15`	`+`
	`16`	`+示例 1:`
	`17`	`+`
	`18`	`+输入:envelopes = [[5,4],[6,4],[6,7],[2,3]]`
	`19`	`+输出:3`
	`20`	`+解释:最多信封的个数为 3, 组合为: [2,3] => [5,4] => [6,7]。`
	`21`	`+示例 2:`
	`22`	`+`
	`23`	`+输入:envelopes = [[1,1],[1,1],[1,1]]`
	`24`	`+输出:1`
	`25`	`+`
	`26`	`+`
	`27`	`+提示:`
	`28`	`+`
	`29`	`+1 <= envelopes.length <= 5000`
	`30`	`+envelopes[i].length == 2`
	`31`	`+1 <= wi, hi <= 104`
	`32`	`+`
	`33`	`+来源:力扣(LeetCode)`
	`34`	`+链接:https://leetcode-cn.com/problems/russian-doll-envelopes`
	`35`	`+著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。`
	`36`	`+`
	`37`	+```

Lines changed: 31 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,31 @@`
	`1`	`+package envelopes`
	`2`	`+`
	`3`	`+import "sort"`
	`4`	`+`
	`5`	`+func Run() {`
	`6`	`+ r := [][]int{`
	`7`	`+ []int{5, 4},`
	`8`	`+ []int{6, 4},`
	`9`	`+ []int{6, 7},`
	`10`	`+ []int{2, 3},`
	`11`	`+ }`
	`12`	`+ me := maxEnvelopes(r)`
	`13`	`+ println(me)`
	`14`	`+}`
	`15`	`+func maxEnvelopes(envelopes [][]int) int {`
	`16`	`+ sort.Slice(envelopes, func(i, j int) bool {`
	`17`	`+ a, b := envelopes[i], envelopes[j]`
	`18`	`+ return a[0] < b[0] \|\| a[0] == b[0] && a[1] > b[1]`
	`19`	`+ })`
	`20`	`+`
	`21`	`+ f := []int{}`
	`22`	`+ for _, e := range envelopes {`
	`23`	`+ h := e[1]`
	`24`	`+ if i := sort.SearchInts(f, h); i < len(f) {`
	`25`	`+ f[i] = h`
	`26`	`+ } else {`
	`27`	`+ f = append(f, h)`
	`28`	`+ }`
	`29`	`+ }`
	`30`	`+ return len(f)`
	`31`	`+}`

Lines changed: 8 additions & 0 deletions

Comments

(0)