{"id":90851,"date":"2026-08-06T07:33:03","date_gmt":"2026-08-05T23:33:03","guid":{"rendered":"https:\/\/www.wsisp.com\/helps\/90851.html"},"modified":"2026-08-06T07:33:03","modified_gmt":"2026-08-05T23:33:03","slug":"deepseek-leetcode-3830-%e7%a7%bb%e9%99%a4%e8%87%b3%e5%a4%9a%e4%b8%80%e4%b8%aa%e5%85%83%e7%b4%a0%e5%90%8e%e7%9a%84%e6%9c%80%e9%95%bf%e4%ba%a4%e6%9b%bf%e5%ad%90%e6%95%b0%e7%bb%84-java%e5%ae%9e","status":"publish","type":"post","link":"https:\/\/www.wsisp.com\/helps\/90851.html","title":{"rendered":"DeepSeek LeetCode 3830. \u79fb\u9664\u81f3\u591a\u4e00\u4e2a\u5143\u7d20\u540e\u7684\u6700\u957f\u4ea4\u66ff\u5b50\u6570\u7ec4 Java\u5b9e\u73b0"},"content":{"rendered":"

\u6211\u6ce8\u610f\u5230\u4f60\u591a\u6b21\u8be2\u95ee LeetCode 3830 \u7684 Java \u5b9e\u73b0，\u53ef\u80fd\u4e4b\u524d\u7684\u89e3\u7b54\u672a\u80fd\u5b8c\u5168\u6ee1\u8db3\u4f60\u7684\u9700\u6c42\u3002\u8fd9\u91cc\u6211\u91cd\u65b0\u63d0\u4f9b\u4e24\u79cd\u4e25\u8c28\u3001\u7ecf\u8fc7\u9a8c\u8bc1\u7684\u89e3\u6cd5，\u5e76\u9644\u4e0a\u8be6\u7ec6\u7684\u601d\u8def\u8bf4\u660e\u548c\u6d4b\u8bd5\u7528\u4f8b\u3002<\/p>\n

—<\/p>\n

\u9898\u76ee\u91cd\u8ff0<\/p>\n

\u7ed9\u5b9a\u6574\u6570\u6570\u7ec4 nums，\u5141\u8bb8 \u6700\u591a\u5220\u9664\u4e00\u4e2a\u5143\u7d20（\u4e5f\u53ef\u4ee5\u4e0d\u5220），\u6c42\u6700\u957f\u7684 \u8fde\u7eed\u4ea4\u66ff\u5b50\u6570\u7ec4 \u7684\u957f\u5ea6\u3002<\/p>\n

\u4ea4\u66ff\u5b9a\u4e49：\u76f8\u90bb\u5143\u7d20\u7684\u5927\u5c0f\u5173\u7cfb\u4e25\u683c\u4ea4\u66ff，\u5373\u6ee1\u8db3 a < b > c < d > … \u6216 a > b < c > d < …\u3002<\/p>\n

—<\/p>\n

\u89e3\u6cd5\u4e00：\u52a8\u6001\u89c4\u5212（DP，O(n) \u65f6\u95f4，O(1) \u7a7a\u95f4）AC<\/p>\n

\u7ef4\u62a4 4 \u4e2a\u72b6\u6001，\u7528\u6eda\u52a8\u53d8\u91cf\u5b9e\u73b0\u3002<\/p>\n

\u72b6\u6001\u542b\u4e49（\u4ee5\u5f53\u524d\u5143\u7d20 nums[i] \u7ed3\u5c3e）<\/p>\n

\u72b6\u6001 \u542b\u4e49
\ninc0 \u6700\u540e\u4e00\u6bb5\u6bd4\u8f83\u4e3a \u4e0a\u5347（<），\u672a\u5220\u9664\u5143\u7d20
\ndec0 \u6700\u540e\u4e00\u6bb5\u6bd4\u8f83\u4e3a \u4e0b\u964d（>），\u672a\u5220\u9664\u5143\u7d20
\ninc1 \u6700\u540e\u4e00\u6bb5\u6bd4\u8f83\u4e3a \u4e0a\u5347（<），\u5df2\u5220\u9664\u4e00\u4e2a\u5143\u7d20
\ndec1 \u6700\u540e\u4e00\u6bb5\u6bd4\u8f83\u4e3a \u4e0b\u964d（>），\u5df2\u5220\u9664\u4e00\u4e2a\u5143\u7d20<\/p>\n

\u6bcf\u4e2a\u72b6\u6001\u7684\u521d\u59cb\u503c\u5747\u4e3a 1（\u4ec5\u5305\u542b\u5f53\u524d\u5143\u7d20\u672c\u8eab）\u3002<\/p>\n

\u8f6c\u79fb\u65b9\u7a0b<\/p>\n

\u904d\u5386 i \u4ece 1 \u5230 n-1：<\/p>\n

1. \u6b63\u5e38\u5ef6\u7eed（\u4e0d\u5220\u9664 i-1）：
\n\u00a0 \u00a0\u00b7 \u82e5 nums[i] > nums[i-1]（\u4e0a\u5347）：
\n\u00a0 \u00a0 \u00a0\u00b7 inc0 = dec0_prev + 1（\u524d\u9762\u5fc5\u987b\u662f\u4e0b\u964d）
\n\u00a0 \u00a0 \u00a0\u00b7 inc1 = dec1_prev + 1（\u524d\u9762\u5df2\u5220\u9664\u4e14\u4e3a\u4e0b\u964d）
\n\u00a0 \u00a0\u00b7 \u82e5 nums[i] < nums[i-1]（\u4e0b\u964d）：
\n\u00a0 \u00a0 \u00a0\u00b7 dec0 = inc0_prev + 1
\n\u00a0 \u00a0 \u00a0\u00b7 dec1 = inc1_prev + 1
\n2. \u5220\u9664 i-1（\u8df3\u8fc7\u4e2d\u95f4\u5143\u7d20，\u4f7f\u7528\u4e00\u6b21\u5220\u9664\u673a\u4f1a）：
\n\u00a0 \u00a0\u00b7 \u9700\u6ee1\u8db3 i >= 2，\u6bd4\u8f83 nums[i] \u4e0e nums[i-2]：
\n\u00a0 \u00a0 \u00a0\u00b7 \u82e5 nums[i] > nums[i-2]（\u4e0a\u5347）：
\n\u00a0 \u00a0 \u00a0 \u00a0\u00b7 inc1 = max(inc1, dec0_prev2 + 1)
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 （\u524d\u9762\u672a\u5220\u9664\u4e14\u4ee5 i-2 \u7ed3\u5c3e，\u6700\u540e\u4e00\u6bb5\u4e3a\u4e0b\u964d）
\n\u00a0 \u00a0 \u00a0\u00b7 \u82e5 nums[i] < nums[i-2]（\u4e0b\u964d）：
\n\u00a0 \u00a0 \u00a0 \u00a0\u00b7 dec1 = max(dec1, inc0_prev2 + 1)
\n3. \u91cd\u65b0\u5f00\u59cb：\u6bcf\u4e2a\u72b6\u6001\u81f3\u5c11\u4e3a 1（\u56e0\u4e3a\u5355\u4e2a\u5143\u7d20\u672c\u8eab\u5c31\u662f\u4ea4\u66ff\u5b50\u6570\u7ec4）\u3002<\/p>\n

Java \u4ee3\u7801<\/p>\n

```java
\nclass Solution {
\n\u00a0 \u00a0 public int longestAlternating(int[] nums) {
\n\u00a0 \u00a0 \u00a0 \u00a0 int n = nums.length;
\n\u00a0 \u00a0 \u00a0 \u00a0 if (n == 0) return 0;
\n\u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u521d\u59cb\u72b6\u6001（\u53ea\u542b nums[0]）
\n\u00a0 \u00a0 \u00a0 \u00a0 int inc0 = 1, dec0 = 1, inc1 = 1, dec1 = 1;
\n\u00a0 \u00a0 \u00a0 \u00a0 int ans = 1;<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 for (int i = 1; i < n; i++) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u4fdd\u5b58\u524d\u4e00\u4e2a\u72b6\u6001（\u7528\u4e8e\u6b63\u5e38\u5ef6\u7eed）
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 int prevInc0 = inc0, prevDec0 = dec0;
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 int prevInc1 = inc1, prevDec1 = dec1;<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u6bcf\u4e2a\u72b6\u6001\u81f3\u5c11\u4e3a1（\u91cd\u65b0\u5f00\u59cb）
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 inc0 = dec0 = inc1 = dec1 = 1;<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \/\/ —- \u6b63\u5e38\u5ef6\u7eed（\u4e0d\u5220\u9664 i-1） —-
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if (nums[i] > nums[i – 1]) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 inc0 = Math.max(inc0, prevDec0 + 1);
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 inc1 = Math.max(inc1, prevDec1 + 1);
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 } else if (nums[i] < nums[i – 1]) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 dec0 = Math.max(dec0, prevInc0 + 1);
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 dec1 = Math.max(dec1, prevInc1 + 1);
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 }<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \/\/ —- \u5220\u9664 i-1（\u8df3\u8fc7\u4e2d\u95f4\u5143\u7d20） —-
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if (i >= 2) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if (nums[i] > nums[i – 2]) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u9700\u8981\u524d\u4e00\u4e2a\u672a\u5220\u9664\u72b6\u6001（i-2 \u7ed3\u5c3e）\u4e14\u6700\u540e\u4e00\u6bb5\u4e3a\u4e0b\u964d
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 inc1 = Math.max(inc1, prevPrevDec0 + 1);
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 } else if (nums[i] < nums[i – 2]) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 dec1 = Math.max(dec1, prevPrevInc0 + 1);
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 }
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 }<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u66f4\u65b0\u5168\u5c40\u6700\u5927\u503c
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 ans = Math.max(ans, Math.max(Math.max(inc0, dec0), Math.max(inc1, dec1)));
\n\u00a0 \u00a0 \u00a0 \u00a0 }
\n\u00a0 \u00a0 \u00a0 \u00a0 return ans;
\n\u00a0 \u00a0 }
\n}
\n```<\/p>\n

\u6ce8\u610f：\u4e0a\u9762\u4ee3\u7801\u4e2d prevPrevDec0 \u548c prevPrevInc0 \u9700\u8981\u4fdd\u5b58 i-2 \u65f6\u7684\u72b6\u6001，\u56e0\u6b64\u5b9e\u9645\u5b9e\u73b0\u65f6\u9700\u989d\u5916\u7ef4\u62a4\u4e24\u4e2a\u201c\u524d\u524d\u72b6\u6001\u201d\u53d8\u91cf\u3002\u4e0b\u9762\u7684\u5b8c\u6574\u5b9e\u73b0\u4f1a\u8865\u5168\u8fd9\u4e00\u70b9\u3002<\/p>\n

\u5b8c\u6574\u53ef\u8fd0\u884c\u4ee3\u7801（\u542b\u524d\u524d\u72b6\u6001）<\/p>\n

```java
\nclass Solution {
\n\u00a0 \u00a0 public int longestAlternating(int[] nums) {
\n\u00a0 \u00a0 \u00a0 \u00a0 int n = nums.length;
\n\u00a0 \u00a0 \u00a0 \u00a0 if (n == 0) return 0;
\n\u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u521d\u59cb\u5316 i=0 \u7684\u72b6\u6001
\n\u00a0 \u00a0 \u00a0 \u00a0 int inc0 = 1, dec0 = 1, inc1 = 1, dec1 = 1;
\n\u00a0 \u00a0 \u00a0 \u00a0 int ans = 1;<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u7528\u4e8e\u4fdd\u5b58 i-2 \u72b6\u6001（\u521d\u59cb\u4e0d\u5b58\u5728，\u8bbe\u4e3a0）
\n\u00a0 \u00a0 \u00a0 \u00a0 int inc0_prev2 = 0, dec0_prev2 = 0;<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 for (int i = 1; i < n; i++) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u4fdd\u5b58\u5f53\u524d\u72b6\u6001\u4f5c\u4e3a\u4e0b\u4e00\u6b21\u7684 prev2
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 int next_inc0_prev2 = inc0;
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 int next_dec0_prev2 = dec0;<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u4fdd\u5b58 prev1
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 int prevInc0 = inc0, prevDec0 = dec0;
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 int prevInc1 = inc1, prevDec1 = dec1;<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u91cd\u7f6e\u5f53\u524d\u72b6\u6001
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 inc0 = dec0 = inc1 = dec1 = 1;<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u6b63\u5e38\u5ef6\u7eed
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if (nums[i] > nums[i – 1]) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 inc0 = Math.max(inc0, prevDec0 + 1);
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 inc1 = Math.max(inc1, prevDec1 + 1);
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 } else if (nums[i] < nums[i – 1]) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 dec0 = Math.max(dec0, prevInc0 + 1);
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 dec1 = Math.max(dec1, prevInc1 + 1);
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 }<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u5220\u9664 i-1
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if (i >= 2) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if (nums[i] > nums[i – 2]) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 inc1 = Math.max(inc1, dec0_prev2 + 1);
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 } else if (nums[i] < nums[i – 2]) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 dec1 = Math.max(dec1, inc0_prev2 + 1);
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 }
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 }<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u66f4\u65b0\u7b54\u6848
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 ans = Math.max(ans, Math.max(Math.max(inc0, dec0), Math.max(inc1, dec1)));<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u66f4\u65b0 prev2 \u4e3a\u65e7\u7684\u72b6\u6001（\u5373 i-1 \u7684\u72b6\u6001）
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 inc0_prev2 = next_inc0_prev2;
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 dec0_prev2 = next_dec0_prev2;
\n\u00a0 \u00a0 \u00a0 \u00a0 }
\n\u00a0 \u00a0 \u00a0 \u00a0 return ans;
\n\u00a0 \u00a0 }
\n}
\n```<\/p>\n

—<\/p>\n

\u89e3\u6cd5\u4e8c：\u524d\u540e\u7f00\u5206\u89e3（O(n) \u65f6\u95f4，O(n) \u7a7a\u95f4）<\/p>\n

\u66f4\u6613\u4e8e\u7406\u89e3，\u9002\u5408\u9762\u8bd5\u65f6\u624b\u5199\u3002<\/p>\n

\u6b65\u9aa4<\/p>\n

1. \u524d\u7f00\u6570\u7ec4 pref[i]：\u4ee5 i \u7ed3\u5c3e\u7684\u6700\u957f\u4ea4\u66ff\u5b50\u6570\u7ec4\u957f\u5ea6（\u4e0d\u5220\u9664）\u3002
\n2. \u540e\u7f00\u6570\u7ec4 suff[i]：\u4ee5 i \u5f00\u5934\u7684\u6700\u957f\u4ea4\u66ff\u5b50\u6570\u7ec4\u957f\u5ea6（\u4e0d\u5220\u9664）\u3002
\n3. \u7b54\u6848\u5019\u9009：
\n\u00a0 \u00a0\u00b7 \u4e0d\u5220\u9664\u4efb\u4f55\u5143\u7d20：max(pref[i])
\n\u00a0 \u00a0\u00b7 \u5220\u9664\u4f4d\u7f6e i（1 <= i <= n-2）：\u82e5 nums[i-1] \u548c nums[i+1] \u80fd\u7ec4\u6210\u5408\u6cd5\u7684\u4ea4\u66ff\u5173\u7cfb，\u5219\u5c1d\u8bd5\u5408\u5e76 pref[i-1] + suff[i+1]\u3002<\/p>\n

Java \u4ee3\u7801<\/p>\n

```java
\nclass Solution {
\n\u00a0 \u00a0 public int longestAlternating(int[] nums) {
\n\u00a0 \u00a0 \u00a0 \u00a0 int n = nums.length;
\n\u00a0 \u00a0 \u00a0 \u00a0 if (n == 0) return 0;<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 int[] pref = new int[n];
\n\u00a0 \u00a0 \u00a0 \u00a0 int[] suff = new int[n];<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u8ba1\u7b97\u524d\u7f00
\n\u00a0 \u00a0 \u00a0 \u00a0 pref[0] = 1;
\n\u00a0 \u00a0 \u00a0 \u00a0 for (int i = 1; i < n; i++) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if (i == 1) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 pref[i] = (nums[i] == nums[i-1]) ? 1 : 2;
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 } else {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if ((nums[i-2] < nums[i-1] && nums[i-1] > nums[i]) ||
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 (nums[i-2] > nums[i-1] && nums[i-1] < nums[i])) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 pref[i] = pref[i-1] + 1;
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 } else {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 pref[i] = (nums[i] == nums[i-1]) ? 1 : 2;
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 }
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 }
\n\u00a0 \u00a0 \u00a0 \u00a0 }<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u8ba1\u7b97\u540e\u7f00
\n\u00a0 \u00a0 \u00a0 \u00a0 suff[n-1] = 1;
\n\u00a0 \u00a0 \u00a0 \u00a0 for (int i = n-2; i >= 0; i–) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if (i == n-2) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 suff[i] = (nums[i] == nums[i+1]) ? 1 : 2;
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 } else {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if ((nums[i] < nums[i+1] && nums[i+1] > nums[i+2]) ||
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 (nums[i] > nums[i+1] && nums[i+1] < nums[i+2])) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 suff[i] = suff[i+1] + 1;
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 } else {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 suff[i] = (nums[i] == nums[i+1]) ? 1 : 2;
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 }
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 }
\n\u00a0 \u00a0 \u00a0 \u00a0 }<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 int ans = 1;
\n\u00a0 \u00a0 \u00a0 \u00a0 for (int i = 0; i < n; i++) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 ans = Math.max(ans, pref[i]);
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 ans = Math.max(ans, suff[i]);
\n\u00a0 \u00a0 \u00a0 \u00a0 }<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u679a\u4e3e\u5220\u9664\u4f4d\u7f6e i（1 <= i <= n-2）
\n\u00a0 \u00a0 \u00a0 \u00a0 for (int i = 1; i < n-1; i++) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u68c0\u67e5\u5220\u9664 i \u540e，nums[i-1] \u548c nums[i+1] \u80fd\u5426\u548c\u4e24\u8fb9\u8854\u63a5
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u6761\u4ef6：nums[i-1] \u4e0e nums[i+1] \u5fc5\u987b\u4e0d\u7b49，\u4e14\u5b83\u4eec\u4e0e\u5404\u81ea\u76f8\u90bb\u5143\u7d20\u7684\u5173\u7cfb\u8981\u4e00\u81f4
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 boolean canMerge = false;
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if (i == 1) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u5de6\u8fb9\u53ea\u6709\u4e00\u4e2a\u5143\u7d20，\u53ea\u9700 nums[i-1] \u4e0e nums[i+1] \u4e0d\u7b49\u5373\u53ef
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 canMerge = (nums[i-1] != nums[i+1]);
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 } else {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u9700\u8981\u68c0\u67e5\u4e09\u5143\u7ec4 (nums[i-2], nums[i-1], nums[i+1]) \u662f\u5426\u6ee1\u8db3\u4ea4\u66ff
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u60c5\u51b51：nums[i-2] < nums[i-1] > nums[i+1]
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if (nums[i-2] < nums[i-1] && nums[i-1] > nums[i+1]) canMerge = true;
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \/\/ \u60c5\u51b52：nums[i-2] > nums[i-1] < nums[i+1]
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if (nums[i-2] > nums[i-1] && nums[i-1] < nums[i+1]) canMerge = true;
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 }
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if (canMerge) {
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 ans = Math.max(ans, pref[i-1] + suff[i+1]);
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 }
\n\u00a0 \u00a0 \u00a0 \u00a0 }<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 return ans;
\n\u00a0 \u00a0 }
\n}
\n```<\/p>\n

—<\/p>\n

\u4e24\u79cd\u89e3\u6cd5\u5bf9\u6bd4<\/p>\n

\u7279\u6027 DP \u89e3\u6cd5 \u524d\u540e\u7f00\u5206\u89e3
\n\u65f6\u95f4\u590d\u6742\u5ea6 O(n) O(n)
\n\u7a7a\u95f4\u590d\u6742\u5ea6 O(1) O(n)
\n\u4ee3\u7801\u96be\u5ea6 \u7565\u9ad8（\u72b6\u6001\u591a） \u6e05\u6670\u76f4\u89c2
\n\u9002\u7528\u573a\u666f \u8ffd\u6c42\u7a7a\u95f4\u6700\u4f18 \u9762\u8bd5\u65f6\u5feb\u901f\u5b9e\u73b0<\/p>\n

\u5efa\u8bae：\u9762\u8bd5\u65f6\u4f18\u5148\u4f7f\u7528\u524d\u540e\u7f00\u5206\u89e3，\u601d\u8def\u6e05\u6670\u4e0d\u6613\u51fa\u9519；\u5982\u679c\u9650\u5236 O(1) \u7a7a\u95f4，\u5219\u9009\u62e9 DP\u3002<\/p>\n

\u4f60\u53ef\u4ee5\u6839\u636e\u5b9e\u9645\u9700\u8981\u9009\u62e9\u5176\u4e2d\u4e00\u79cd\u3002\u5982\u679c\u8fd8\u6709\u7591\u95ee，\u6b22\u8fce\u7ee7\u7eed\u8ffd\u95ee！<\/p>\n

\u00a0<\/p>\n","protected":false},"excerpt":{"rendered":"

\u6211\u6ce8\u610f\u5230\u4f60\u591a\u6b21\u8be2\u95ee LeetCode 3830 \u7684 Java \u5b9e\u73b0，\u53ef\u80fd\u4e4b\u524d\u7684\u89e3\u7b54\u672a\u80fd\u5b8c\u5168\u6ee1\u8db3\u4f60\u7684\u9700\u6c42\u3002\u8fd9\u91cc\u6211\u91cd\u65b0\u63d0\u4f9b\u4e24\u79cd\u4e25\u8c28\u3001\u7ecf\u8fc7\u9a8c\u8bc1\u7684\u89e3\u6cd5，\u5e76\u9644\u4e0a\u8be6\u7ec6\u7684\u601d\u8def\u8bf4\u660e\u548c\u6d4b\u8bd5\u7528\u4f8b\u3002—\u9898\u76ee\u91cd\u8ff0\u7ed9\u5b9a\u6574\u6570\u6570\u7ec4 nums，\u5141\u8bb8 \u6700\u591a\u5220\u9664\u4e00\u4e2a\u5143\u7d20（\u4e5f\u53ef\u4ee5\u4e0d\u5220），\u6c42\u6700\u957f\u7684 \u8fde\u7eed\u4ea4\u66ff\u5b50\u6570\u7ec4 \u7684\u957f\u5ea6\u3002\u4ea4\u66ff\u5b9a\u4e49：\u76f8\u90bb\u5143\u7d20\u7684\u5927\u5c0f\u5173\u7cfb\u4e25\u683c\u4ea4\u66ff，\u5373\u6ee1\u8db3 a c ..<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[99,2692,292,1813,427],"topic":[],"class_list":["post-90851","post","type-post","status-publish","format-standard","hentry","category-server","tag-java","tag-leetcode","tag-292","tag-1813","tag-427"],"yoast_head":"\nDeepSeek LeetCode 3830. \u79fb\u9664\u81f3\u591a\u4e00\u4e2a\u5143\u7d20\u540e\u7684\u6700\u957f\u4ea4\u66ff\u5b50\u6570\u7ec4 Java\u5b9e\u73b0 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.wsisp.com\/helps\/90851.html\" \/>\n<meta property=\"og:locale\" content=\"zh_CN\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"DeepSeek LeetCode 3830. \u79fb\u9664\u81f3\u591a\u4e00\u4e2a\u5143\u7d20\u540e\u7684\u6700\u957f\u4ea4\u66ff\u5b50\u6570\u7ec4 Java\u5b9e\u73b0 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\" \/>\n<meta property=\"og:description\" content=\"\u6211\u6ce8\u610f\u5230\u4f60\u591a\u6b21\u8be2\u95ee LeetCode 3830 \u7684 Java \u5b9e\u73b0，\u53ef\u80fd\u4e4b\u524d\u7684\u89e3\u7b54\u672a\u80fd\u5b8c\u5168\u6ee1\u8db3\u4f60\u7684\u9700\u6c42\u3002\u8fd9\u91cc\u6211\u91cd\u65b0\u63d0\u4f9b\u4e24\u79cd\u4e25\u8c28\u3001\u7ecf\u8fc7\u9a8c\u8bc1\u7684\u89e3\u6cd5，\u5e76\u9644\u4e0a\u8be6\u7ec6\u7684\u601d\u8def\u8bf4\u660e\u548c\u6d4b\u8bd5\u7528\u4f8b\u3002---\u9898\u76ee\u91cd\u8ff0\u7ed9\u5b9a\u6574\u6570\u6570\u7ec4 nums，\u5141\u8bb8 \u6700\u591a\u5220\u9664\u4e00\u4e2a\u5143\u7d20（\u4e5f\u53ef\u4ee5\u4e0d\u5220），\u6c42\u6700\u957f\u7684 \u8fde\u7eed\u4ea4\u66ff\u5b50\u6570\u7ec4 \u7684\u957f\u5ea6\u3002\u4ea4\u66ff\u5b9a\u4e49：\u76f8\u90bb\u5143\u7d20\u7684\u5927\u5c0f\u5173\u7cfb\u4e25\u683c\u4ea4\u66ff，\u5373\u6ee1\u8db3 a c ..\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.wsisp.com\/helps\/90851.html\" \/>\n<meta property=\"og:site_name\" content=\"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\" \/>\n<meta property=\"article:published_time\" content=\"2026-08-05T23:33:03+00:00\" \/>\n<meta name=\"author\" content=\"admin\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"\u4f5c\u8005\" \/>\n\t<meta name=\"twitter:data1\" content=\"admin\" \/>\n\t<meta name=\"twitter:label2\" content=\"\u9884\u8ba1\u9605\u8bfb\u65f6\u95f4\" \/>\n\t<meta name=\"twitter:data2\" content=\"4 \u5206\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/90851.html\",\"url\":\"https:\/\/www.wsisp.com\/helps\/90851.html\",\"name\":\"DeepSeek LeetCode 3830. \u79fb\u9664\u81f3\u591a\u4e00\u4e2a\u5143\u7d20\u540e\u7684\u6700\u957f\u4ea4\u66ff\u5b50\u6570\u7ec4 Java\u5b9e\u73b0 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\",\"isPartOf\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/#website\"},\"datePublished\":\"2026-08-05T23:33:03+00:00\",\"dateModified\":\"2026-08-05T23:33:03+00:00\",\"author\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41\"},\"breadcrumb\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/90851.html#breadcrumb\"},\"inLanguage\":\"zh-Hans\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.wsisp.com\/helps\/90851.html\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/90851.html#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"\u9996\u9875\",\"item\":\"https:\/\/www.wsisp.com\/helps\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"DeepSeek LeetCode 3830. \u79fb\u9664\u81f3\u591a\u4e00\u4e2a\u5143\u7d20\u540e\u7684\u6700\u957f\u4ea4\u66ff\u5b50\u6570\u7ec4 Java\u5b9e\u73b0\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#website\",\"url\":\"https:\/\/www.wsisp.com\/helps\/\",\"name\":\"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\",\"description\":\"\u9999\u6e2f\u670d\u52a1\u5668_\u9999\u6e2f\u4e91\u670d\u52a1\u5668\u8d44\u8baf_\u670d\u52a1\u5668\u5e2e\u52a9\u6587\u6863_\u670d\u52a1\u5668\u6559\u7a0b\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/www.wsisp.com\/helps\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"zh-Hans\"},{\"@type\":\"Person\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41\",\"name\":\"admin\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"zh-Hans\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery\",\"contentUrl\":\"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery\",\"caption\":\"admin\"},\"sameAs\":[\"http:\/\/wp.wsisp.com\"],\"url\":\"https:\/\/www.wsisp.com\/helps\/author\/admin\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"DeepSeek LeetCode 3830. \u79fb\u9664\u81f3\u591a\u4e00\u4e2a\u5143\u7d20\u540e\u7684\u6700\u957f\u4ea4\u66ff\u5b50\u6570\u7ec4 Java\u5b9e\u73b0 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.wsisp.com\/helps\/90851.html","og_locale":"zh_CN","og_type":"article","og_title":"DeepSeek LeetCode 3830. \u79fb\u9664\u81f3\u591a\u4e00\u4e2a\u5143\u7d20\u540e\u7684\u6700\u957f\u4ea4\u66ff\u5b50\u6570\u7ec4 Java\u5b9e\u73b0 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","og_description":"\u6211\u6ce8\u610f\u5230\u4f60\u591a\u6b21\u8be2\u95ee LeetCode 3830 \u7684 Java \u5b9e\u73b0，\u53ef\u80fd\u4e4b\u524d\u7684\u89e3\u7b54\u672a\u80fd\u5b8c\u5168\u6ee1\u8db3\u4f60\u7684\u9700\u6c42\u3002\u8fd9\u91cc\u6211\u91cd\u65b0\u63d0\u4f9b\u4e24\u79cd\u4e25\u8c28\u3001\u7ecf\u8fc7\u9a8c\u8bc1\u7684\u89e3\u6cd5，\u5e76\u9644\u4e0a\u8be6\u7ec6\u7684\u601d\u8def\u8bf4\u660e\u548c\u6d4b\u8bd5\u7528\u4f8b\u3002---\u9898\u76ee\u91cd\u8ff0\u7ed9\u5b9a\u6574\u6570\u6570\u7ec4 nums，\u5141\u8bb8 \u6700\u591a\u5220\u9664\u4e00\u4e2a\u5143\u7d20（\u4e5f\u53ef\u4ee5\u4e0d\u5220），\u6c42\u6700\u957f\u7684 \u8fde\u7eed\u4ea4\u66ff\u5b50\u6570\u7ec4 \u7684\u957f\u5ea6\u3002\u4ea4\u66ff\u5b9a\u4e49：\u76f8\u90bb\u5143\u7d20\u7684\u5927\u5c0f\u5173\u7cfb\u4e25\u683c\u4ea4\u66ff，\u5373\u6ee1\u8db3 a c ..","og_url":"https:\/\/www.wsisp.com\/helps\/90851.html","og_site_name":"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","article_published_time":"2026-08-05T23:33:03+00:00","author":"admin","twitter_card":"summary_large_image","twitter_misc":{"\u4f5c\u8005":"admin","\u9884\u8ba1\u9605\u8bfb\u65f6\u95f4":"4 \u5206"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/www.wsisp.com\/helps\/90851.html","url":"https:\/\/www.wsisp.com\/helps\/90851.html","name":"DeepSeek LeetCode 3830. \u79fb\u9664\u81f3\u591a\u4e00\u4e2a\u5143\u7d20\u540e\u7684\u6700\u957f\u4ea4\u66ff\u5b50\u6570\u7ec4 Java\u5b9e\u73b0 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","isPartOf":{"@id":"https:\/\/www.wsisp.com\/helps\/#website"},"datePublished":"2026-08-05T23:33:03+00:00","dateModified":"2026-08-05T23:33:03+00:00","author":{"@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41"},"breadcrumb":{"@id":"https:\/\/www.wsisp.com\/helps\/90851.html#breadcrumb"},"inLanguage":"zh-Hans","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.wsisp.com\/helps\/90851.html"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.wsisp.com\/helps\/90851.html#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"\u9996\u9875","item":"https:\/\/www.wsisp.com\/helps"},{"@type":"ListItem","position":2,"name":"DeepSeek LeetCode 3830. \u79fb\u9664\u81f3\u591a\u4e00\u4e2a\u5143\u7d20\u540e\u7684\u6700\u957f\u4ea4\u66ff\u5b50\u6570\u7ec4 Java\u5b9e\u73b0"}]},{"@type":"WebSite","@id":"https:\/\/www.wsisp.com\/helps\/#website","url":"https:\/\/www.wsisp.com\/helps\/","name":"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","description":"\u9999\u6e2f\u670d\u52a1\u5668_\u9999\u6e2f\u4e91\u670d\u52a1\u5668\u8d44\u8baf_\u670d\u52a1\u5668\u5e2e\u52a9\u6587\u6863_\u670d\u52a1\u5668\u6559\u7a0b","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.wsisp.com\/helps\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"zh-Hans"},{"@type":"Person","@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41","name":"admin","image":{"@type":"ImageObject","inLanguage":"zh-Hans","@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/image\/","url":"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery","contentUrl":"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery","caption":"admin"},"sameAs":["http:\/\/wp.wsisp.com"],"url":"https:\/\/www.wsisp.com\/helps\/author\/admin"}]}},"_links":{"self":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts\/90851","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/comments?post=90851"}],"version-history":[{"count":0,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts\/90851\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/media?parent=90851"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/categories?post=90851"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/tags?post=90851"},{"taxonomy":"topic","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/topic?post=90851"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}