|Accepted|**250**|**321**|**96**|**667**|

|Perfection Rate|84.8%|86.0%|83.3%|85.2%|

|Completion Rate|54.2%|35.4%|25.9%|38.4%|

以下已经收录了 568 道题的题解，还有 13 道题在尝试优化到 beats 100%

|0307|Range Sum Query - Mutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0307.Range-Sum-Query---Mutable)|36.6%|Medium||

|0471|Encode String with Shortest Length||49.0%|Hard||

|0674|Longest Continuous Increasing Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0674.Longest-Continuous-Increasing-Subsequence)|46.0%|Easy||

|0689|Maximum Sum of 3 Non-Overlapping Subarrays||47.2%|Hard||

|0809|Expressive Words||46.5%|Medium||

|0956|Tallest Billboard||39.7%|Hard||

|1226|The Dining Philosophers||59.7%|Medium||

|1266|Minimum Time Visiting All Points|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1266.Minimum-Time-Visiting-All-Points)|79.4%|Easy||

|1322|Ads Performance||57.7%|Easy||

|1330|Reverse Subarray To Maximize Array Value||36.6%|Hard||

|1406|Stone Game III||57.2%|Hard||

|1482|Minimum Number of Days to Make m Bouquets||49.9%|Medium||

|1658|Minimum Operations to Reduce X to Zero|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1658.Minimum-Operations-to-Reduce-X-to-Zero)|33.4%|Medium||

|1687|Delivering Boxes from Storage to Ports||34.7%|Hard||

|1692|Count Ways to Distribute Candies||61.4%|Hard||

|1705|Maximum Number of Eaten Apples||42.3%|Medium||

|1713|Minimum Operations to Make a Subsequence||45.4%|Hard||

|1719|Number Of Ways To Reconstruct A Tree||39.3%|Hard||

|1729|Find Followers Count||72.5%|Easy||

|1730|Shortest Path to Get Food||64.4%|Medium||

|1731|The Number of Employees Which Report to Each Employee||52.8%|Easy||

|1732|Find the Highest Altitude||81.9%|Easy||

|1733|Minimum Number of People to Teach||31.5%|Medium||

|1734|Decode XORed Permutation||43.7%|Medium||

|1735|Count Ways to Make Array With Product||39.9%|Hard||

|1737|Change Minimum Characters to Satisfy One of Three Conditions||23.2%|Medium||

|1738|Find Kth Largest XOR Coordinate Value||60.1%|Medium||

|1739|Building Boxes||42.5%|Hard||

package leetcode

func findLengthOfLCIS(nums []int) int {

if len(nums) == 0 {

return 0

}

res, length := 1, 1

for i := 1; i < len(nums); i++ {

if nums[i] > nums[i-1] {

length++

} else {

res = max(res, length)

length = 1

}

}

return max(res, length)

}

func max(a, b int) int {

if a > b {

return a

}

return b

}

package leetcode

import (

"fmt"

"testing"

)

type question674 struct {

para674

ans674

}

type para674 struct {

nums []int

}

type ans674 struct {

one int

}

func Test_Problem674(t *testing.T) {

qs := []question674{

{

para674{[]int{1, 3, 5, 4, 7}},

ans674{3},

},

{

para674{[]int{2, 2, 2, 2, 2}},

ans674{1},

},

{

para674{[]int{1, 3, 5, 7}},

ans674{4},

},

}

fmt.Printf("------------------------Leetcode Problem 674------------------------\n")

for _, q := range qs {

_, p := q.ans674, q.para674

fmt.Printf("【input】:%v 【output】:%v\n", p, findLengthOfLCIS(p.nums))

}

fmt.Printf("\n\n\n")

}

Given an unsorted array of integers `nums`, return *the length of the longest **continuous increasing subsequence** (i.e. subarray)*. The subsequence must be **strictly** increasing.

A **continuous increasing subsequence** is defined by two indices `l` and `r` (`l < r`) such that it is `[nums[l], nums[l + 1], ..., nums[r - 1], nums[r]]` and for each `l <= i < r`, `nums[i] < nums[i + 1]`.

**Example 1:**

**Example 2:**

**Constraints:**

- `0 <= nums.length <= 10^4`

- `10^9 <= nums[i] <= 10^9`

给定一个未经排序的整数数组，找到最长且 连续递增的子序列，并返回该序列的长度。连续递增的子序列 可以由两个下标 l 和 r（l < r）确定，如果对于每个 l <= i < r，都有 nums[i] < nums[i + 1] ，那么子序列 [nums[l], nums[l + 1], ..., nums[r - 1], nums[r]] 就是连续递增子序列。

- 简单题。这一题和第 128 题有区别。这一题要求子序列必须是连续下标，所以变简单了。扫描一遍数组，记下连续递增序列的长度，动态维护这个最大值，最后输出即可。

package leetcode

func findLengthOfLCIS(nums []int) int {

if len(nums) == 0 {

return 0

}

res, length := 1, 1

for i := 1; i < len(nums); i++ {

if nums[i] > nums[i-1] {

length++

} else {

res = max(res, length)

length = 1

}

}

return max(res, length)

}

func max(a, b int) int {

if a > b {

return a

}

return b

}

<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0674.Longest-Continuous-Increasing-Subsequence/">下一页➡️</a></p>