feat: leetcode 面试题 16.17

README.md

@@ -2,7 +2,7 @@
 
 <p align="center">
 <!-- TOPICS COUNT START -->
-<img src="https://img.shields.io/badge/-进度:165-green" alt="进度:165">
+<img src="https://img.shields.io/badge/-进度:166-green" alt="进度:166">
 <!-- TOPICS COUNT END -->
 <a href="./assets/docs/TOPICS.md"><img src="https://img.shields.io/badge/-题库目录-blue" alt="题库目录"></a>
 <a href="./assets/docs/CATEGORIES.md"><img src="https://img.shields.io/badge/-题库分类-red" alt="题库分类"></a>

assets/data/categories.json

@@ -947,6 +947,12 @@
         "path": "./problemset/the-masseuse-lcci/README.md",
         "difficulty": "简单"
       },
+      {
+        "id": "面试题 16.17",
+        "title": "连续数列",
+        "path": "./problemset/contiguous-sequence-lcci/README.md",
+        "difficulty": "简单"
+      },
       {
         "id": "剑指 Offer 47",
         "title": "礼物的最大价值",

assets/data/topics.json

@@ -1639,6 +1639,16 @@
     "url": "https://leetcode.cn/problems/maximum-lcci/",
     "path": "./problemset/maximum-lcci/README.md"
   },
+  {
+    "id": "面试题 16.17",
+    "title": {
+      "cn": "连续数列",
+      "en": "contiguous-sequence-lcci"
+    },
+    "difficulty": "简单",
+    "url": "https://leetcode.cn/problems/contiguous-sequence-lcci/",
+    "path": "./problemset/contiguous-sequence-lcci/README.md"
+  },
   {
     "id": "剑指 Offer 47",
     "title": {

assets/docs/CATEGORIES.md

@@ -199,6 +199,7 @@
 | 剑指 Offer II 088. [爬楼梯的最少成本](../../problemset/gzcjip/README.md) | 简单 |
 | 剑指 Offer II 003. [前 n 个数字二进制中 1 的个数](../../problemset/w3tcbm/README.md) | 简单 |
 | 面试题 17.16. [按摩师](../../problemset/the-masseuse-lcci/README.md) | 简单 |
+| 面试题 16.17. [连续数列](../../problemset/contiguous-sequence-lcci/README.md) | 简单 |
 | 剑指 Offer 47. [礼物的最大价值](../../problemset/li-wu-de-zui-da-jie-zhi-lcof/README.md) | 中等 |
 
 ## 双指针

assets/docs/TOPICS.md

@@ -328,4 +328,6 @@
 
 [面试题 16.07. 最大数值](../../problemset/maximum-lcci/README.md)
 
+[面试题 16.17. 连续数列](../../problemset/contiguous-sequence-lcci/README.md)
+
 [剑指 Offer 47. 礼物的最大价值](../../problemset/li-wu-de-zui-da-jie-zhi-lcof/README.md)

problemset/contiguous-sequence-lcci/README.md

@@ -0,0 +1,16 @@
+# 连续数列
+
+> 难度：简单
+>
+> https://leetcode.cn/problems/contiguous-sequence-lcci/
+
+## 题目
+
+给定一个整数数组，找出总和最大的连续数列，并返回总和。
+
+### 示例：
+```
+输入： [-2,1,-3,4,-1,2,1,-5,4]
+输出： 6
+解释： 连续子数组 [4,-1,2,1] 的和最大，为 6。
+```

problemset/contiguous-sequence-lcci/index.spec.ts

@@ -0,0 +1,17 @@
+import { describe, expect, it } from 'vitest'
+import { maxSubArray } from '.'
+
+describe('连续数列', () => {
+  describe('', () => {
+    testCase(maxSubArray)
+  })
+})
+
+function testCase(fn: (nums: number[]) => number) {
+  it.each([
+    // test cases
+    [[-2, 1, -3, 4, -1, 2, 1, -5, 4], 6],
+  ])('示例%#', (nums, expected) => {
+    expect(fn(nums)).toBe(expected)
+  })
+}

problemset/contiguous-sequence-lcci/index.ts

@@ -0,0 +1,9 @@
+export function maxSubArray(nums: number[]): number {
+  // [-2, 1, -3, 4, -1, 2, 1, -5, 4]
+  let pre = 0; let maxAns = nums[0];
+  nums.forEach((x) => {
+    pre = Math.max(pre + x, x);
+    maxAns = Math.max(maxAns, pre);
+  });
+  return maxAns;
+}