test: 978 solution

py, c++, go, java

daily-problems.json

@@ -1,4 +1,4 @@
 {
-    "daily": "2385",
+    "daily": "978",
     "plans": ["3582", "problems", "3583", "problems", "3584", "problems", "3585", "problems"]
 }

golang/solution_test.go

@@ -1,10 +1,10 @@
 package golang
 
 import (
-	problem "leetCode/problems/problems_2385"
+	problem "leetCode/problems/problems_978"
 	"testing"
 )
 
 func TestSolution(t *testing.T) {
-	TestEach(t, "2385", "problems", problem.Solve)
+	TestEach(t, "978", "problems", problem.Solve)
 }

problems/problems_978/Solution.cpp

@@ -0,0 +1,42 @@
+//go:build ignore
+#include "cpp/common/Solution.h"
+
+using namespace std;
+using json = nlohmann::json;
+
+class Solution {
+public:
+  int maxTurbulenceSize(vector<int> &arr) {
+    int n = arr.size(), ans = 1;
+    int cur0 = 1, cur1 = 1;
+    for (int i = 1; i < n; ++i) {
+      if (arr[i] > arr[i - 1]) {
+        cur1 = cur0 + 1;
+        cur0 = 1;
+      } else if (arr[i] < arr[i - 1]) {
+        cur0 = cur1 + 1;
+        cur1 = 1;
+      } else {
+        cur0 = 1;
+        cur1 = 1;
+      }
+      ans = max(ans, max(cur0, cur1));
+    }
+    return ans;
+  }
+};
+
+json leetcode::qubh::Solve(string input_json_values) {
+  vector<string> inputArray;
+  size_t pos = input_json_values.find('\n');
+  while (pos != string::npos) {
+    inputArray.push_back(input_json_values.substr(0, pos));
+    input_json_values = input_json_values.substr(pos + 1);
+    pos = input_json_values.find('\n');
+  }
+  inputArray.push_back(input_json_values);
+
+  Solution solution;
+  vector<int> arr = json::parse(inputArray.at(0));
+  return solution.maxTurbulenceSize(arr);
+}

problems/problems_978/Solution.java

@@ -0,0 +1,34 @@
+package problems.problems_978;
+
+import com.alibaba.fastjson.JSON;
+import java.util.*;
+import qubhjava.BaseSolution;
+
+
+public class Solution extends BaseSolution {
+    public int maxTurbulenceSize(int[] arr) {
+        int n = arr.length;
+        int ans = 1;
+        int cur0 = 1, cur1 = 1;
+        for (int i = 1; i < n; i++) {
+            if (arr[i] > arr[i - 1]) {
+                cur1 = cur0 + 1;
+                cur0 = 1;
+            } else if (arr[i] < arr[i - 1]) {
+                cur0 = cur1 + 1;
+                cur1 = 1;
+            } else {
+                cur0 = 1;
+                cur1 = 1;
+            }
+            ans = Math.max(ans, Math.max(cur0, cur1));
+        }
+        return ans;
+    }
+
+    @Override
+    public Object solve(String[] inputJsonValues) {
+        int[] arr = jsonArrayToIntArray(inputJsonValues[0]);
+        return JSON.toJSON(maxTurbulenceSize(arr));
+    }
+}

problems/problems_978/problem.md

@@ -0,0 +1,53 @@
+# 978. Longest Turbulent Subarray [Rating: 1393.41]
+
+<p>Given an integer array <code>arr</code>, return <em>the length of a maximum size turbulent subarray of</em> <code>arr</code>.</p>
+
+<p>A subarray is <strong>turbulent</strong> if the comparison sign flips between each adjacent pair of elements in the subarray.</p>
+
+<p>More formally, a subarray <code>[arr[i], arr[i + 1], ..., arr[j]]</code> of <code>arr</code> is said to be turbulent if and only if:</p>
+
+<ul>
+	<li>For <code>i &lt;= k &lt; j</code>:
+	<ul>
+		<li><code>arr[k] &gt; arr[k + 1]</code> when <code>k</code> is odd, and</li>
+		<li><code>arr[k] &lt; arr[k + 1]</code> when <code>k</code> is even.</li>
+	</ul>
+	</li>
+	<li>Or, for <code>i &lt;= k &lt; j</code>:
+	<ul>
+		<li><code>arr[k] &gt; arr[k + 1]</code> when <code>k</code> is even, and</li>
+		<li><code>arr[k] &lt; arr[k + 1]</code> when <code>k</code> is odd.</li>
+	</ul>
+	</li>
+</ul>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> arr = [9,4,2,10,7,8,8,1,9]
+<strong>Output:</strong> 5
+<strong>Explanation:</strong> arr[1] &gt; arr[2] &lt; arr[3] &gt; arr[4] &lt; arr[5]
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> arr = [4,8,12,16]
+<strong>Output:</strong> 2
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> arr = [100]
+<strong>Output:</strong> 1
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= arr.length &lt;= 4 * 10<sup>4</sup></code></li>
+	<li><code>0 &lt;= arr[i] &lt;= 10<sup>9</sup></code></li>
+</ul>

problems/problems_978/problem_zh.md

@@ -0,0 +1,54 @@
+# 978. 最长湍流子数组 [难度分: 1393.41]
+
+<p>给定一个整数数组 <code>arr</code>&nbsp;，返回 <code>arr</code>&nbsp;的&nbsp;<em>最大湍流子数组的<strong>长度</strong></em><strong>&nbsp;</strong>。</p>
+
+<p>如果比较符号在子数组中的每个相邻元素对之间翻转，则该子数组是&nbsp;<strong>湍流子数组</strong>&nbsp;。</p>
+
+<p>更正式地来说，当 <code>arr</code>&nbsp;的子数组&nbsp;<code>A[i], A[i+1], ..., A[j]</code>&nbsp;满足仅满足下列条件时，我们称其为<em>湍流子数组</em>：</p>
+
+<ul>
+	<li>若&nbsp;<code>i &lt;= k &lt; j</code>&nbsp;：
+	<ul>
+		<li>当 <code>k</code>&nbsp;为奇数时，&nbsp;<code>A[k] &gt; A[k+1]</code>，且</li>
+		<li>当 <code>k</code> 为偶数时，<code>A[k] &lt; A[k+1]</code>；</li>
+	</ul>
+	</li>
+	<li><strong>或 </strong>若&nbsp;<code>i &lt;= k &lt; j</code>&nbsp;：
+	<ul>
+		<li>当 <code>k</code> 为偶数时，<code>A[k] &gt; A[k+1]</code>&nbsp;，且</li>
+		<li>当 <code>k</code>&nbsp;为奇数时，&nbsp;<code>A[k] &lt; A[k+1]</code>。</li>
+	</ul>
+	</li>
+</ul>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>arr = [9,4,2,10,7,8,8,1,9]
+<strong>输出：</strong>5
+<strong>解释：</strong>arr[1] &gt; arr[2] &lt; arr[3] &gt; arr[4] &lt; arr[5]</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>arr = [4,8,12,16]
+<strong>输出：</strong>2
+</pre>
+
+<p><strong>示例 3：</strong></p>
+
+<pre>
+<strong>输入：</strong>arr = [100]
+<strong>输出：</strong>1
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= arr.length &lt;= 4 * 10<sup>4</sup></code></li>
+	<li><code>0 &lt;= arr[i] &lt;= 10<sup>9</sup></code></li>
+</ul>

problems/problems_978/solution.go

@@ -0,0 +1,37 @@
+package problem978
+
+import (
+	"encoding/json"
+	"log"
+	"strings"
+)
+
+func maxTurbulenceSize(arr []int) int {
+	n := len(arr)
+	ans := 1
+	cur0, cur1 := 1, 1
+	for i := 1; i < n; i++ {
+		if arr[i] > arr[i-1] {
+			cur1 = cur0 + 1
+			cur0 = 1
+		} else if arr[i] < arr[i-1] {
+			cur0 = cur1 + 1
+			cur1 = 1
+		} else {
+			cur0, cur1 = 1, 1
+		}
+		ans = max(ans, max(cur0, cur1))
+	}
+	return ans
+}
+
+func Solve(inputJsonValues string) any {
+	inputValues := strings.Split(inputJsonValues, "\n")
+	var arr []int
+
+	if err := json.Unmarshal([]byte(inputValues[0]), &arr); err != nil {
+		log.Fatal(err)
+	}
+
+	return maxTurbulenceSize(arr)
+}

problems/problems_978/solution.py

@@ -0,0 +1,23 @@
+from itertools import pairwise
+
+import solution
+from typing import *
+
+
+class Solution(solution.Solution):
+    def solve(self, test_input=None):
+        return self.maxTurbulenceSize(test_input)
+
+    def maxTurbulenceSize(self, arr: List[int]) -> int:
+        n = len(arr)
+        ans = 1
+        last = [1, 1] # 第一位表示下降，第二位表示上升
+        for i in range(1, n):
+            cur_0 = cur_1 = 1
+            if arr[i] > arr[i-1]:
+                cur_1 += last[0]
+            elif arr[i] < arr[i-1]:
+                cur_0 += last[1]
+            ans = max(ans, cur_0, cur_1)
+            last[0], last[1] = cur_0, cur_1
+        return ans