We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 5ff126f commit 0ae1431Copy full SHA for 0ae1431
300.Longest Increasing Subsequence/README.md
@@ -51,3 +51,29 @@ func max(a, b int) int {
51
return b
52
}
53
```
54
+
55
+binary search
56
57
+```golang
58
+func lengthOfLIS(nums []int) int {
59
+ var piles int
60
+ top := make([]int, len(nums))
61
+ for _, pocker := range nums {
62
+ left, right := 0, piles
63
+ for left < right {
64
+ mid := left + (right - left) / 2
65
+ if top[mid] >= pocker {
66
+ right = mid
67
+ } else {
68
+ left = mid + 1
69
+ }
70
71
+ if left == piles {
72
+ piles++
73
74
+ top[left] = pocker
75
76
77
+ return piles
78
+}
79
+```
0 commit comments