update: 添加问题“2110.股票平滑下跌阶段的数目”的代码和题解 (#1226)

* 1problem1day: archive

* 1problem1day: history function done

* 2110: init(#1225)

* 2110: AC.cpp+py + WA.go + CE.java (#1225)

cpp - AC,100.00%,19.93%
py - AC,100.00%,50.20%

* 2110: AC.go+java+rust (#1225)

go - AC,28.57%,46.43%
java - AC,27.97%,30.07%
rust - AC,14.29%,14.29%

上一个commitmsg写错了，不是CE.java应该是RE.java

* update: 添加问题“2110.股票平滑下跌阶段的数目”的代码和题解 (#1226)

Signed-off-by: LetMeFly666 <[email protected]>

* fix: Update tryGoPy/ReLeetcode/processHistory.py

Co-authored-by: Copilot <[email protected]>

* 1problem1day: 历史题目(自2025.4.1)处理完毕

* 1problem1day: archive

---------

Signed-off-by: LetMeFly666 <[email protected]>
Co-authored-by: Copilot <[email protected]>

Author: LetMeFly666

.commitmsg

@@ -0,0 +1,28 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-12-15 13:32:17
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-12-15 18:52:23
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+typedef long long ll;
+class Solution {
+public:
+    ll getDescentPeriods(vector<int>& prices) {
+        ll ans = 0, cnt = 0;
+        int last = 0;
+        for (int t : prices) {
+            if (t != last - 1) {
+                ans += cnt * (cnt + 1) / 2;
+                // printf("t = %d, cnt = %lld\n", t, cnt);
+                cnt = 0;
+            }
+            last = t;
+            cnt++;
+        }
+        return ans + cnt * (cnt + 1) / 2;
+    }
+};

Codes/2110-number-of-smooth-descent-periods-of-a-stock.cpp

@@ -0,0 +1,23 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-12-15 13:32:17
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-12-15 21:46:22
+ */
+package main
+
+func getDescentPeriods(prices []int) (ans int64) {
+    var cnt int64
+    last := 0
+    for i := 0; i <= len(prices); i++ {
+        if i == len(prices) || prices[i] != last - 1 {
+            ans += cnt * (cnt + 1) / 2
+            cnt = 0
+        }
+        cnt++
+        if i < len(prices) {
+            last = prices[i]
+        }
+    }
+    return
+}

Codes/2110-number-of-smooth-descent-periods-of-a-stock.go

@@ -0,0 +1,22 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-12-15 13:32:17
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-12-15 21:37:22
+ */
+class Solution {
+    public long getDescentPeriods(int[] prices) {
+        long ans = 0, cnt = 0;
+        for (int last = 0, i = 0; i <= prices.length; i++) {
+            if (i == prices.length || prices[i] != last - 1) {
+                ans += cnt * (cnt + 1) / 2;
+                cnt = 0;
+            }
+            cnt++;
+            if (i < prices.length) {
+                last = prices[i];
+            }
+        }
+        return ans;
+    }
+}

Codes/2110-number-of-smooth-descent-periods-of-a-stock.java

@@ -0,0 +1,18 @@
+'''
+Author: LetMeFly
+Date: 2025-12-15 13:32:17
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-12-15 18:54:39
+'''
+from typing import List
+
+class Solution:
+    def getDescentPeriods(self, prices: List[int]) -> int:
+        ans = last = cnt = 0
+        for p in prices:
+            if p != last - 1:
+                ans += cnt * (cnt + 1) // 2
+                cnt = 0
+            cnt += 1
+            last = p
+        return ans + cnt * (cnt + 1) // 2

Codes/2110-number-of-smooth-descent-periods-of-a-stock.py

@@ -0,0 +1,22 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-12-15 21:33:12
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-12-15 21:41:17
+ */
+impl Solution {
+    pub fn get_descent_periods(prices: Vec<i32>) -> i64 {
+        let mut ans: i64 = 0;
+        let mut cnt: i64 = 0;
+        let mut last: i32 = 0;
+        for p in prices {  // 一借不还
+            if p != last - 1 {
+                ans += cnt * (cnt + 1) / 2;
+                cnt = 0;
+            }
+            cnt += 1;
+            last = p;
+        }
+        ans + cnt * (cnt + 1) / 2
+    }
+}

Codes/2110-number-of-smooth-descent-periods-of-a-stock.rs

@@ -37,7 +37,7 @@ class Solution {
                 }
             }
         }
-        if (!ing && now != 0 || !atLeast2) {
+        if (!ing || !atLeast2) {
             return 0;
         }
         return static_cast<int>(ans);

Codes/2147-number-of-ways-to-divide-a-long-corridor.cpp

@@ -1,6 +1,6 @@
 /*
  * @Author: LetMeFly
- * @Date: 2025-12-13 22:41:43
+ * @Date: 2025-12-13 22:26:53
  * @LastEditors: LetMeFly.xyz
  * @LastEditTime: 2025-12-13 22:42:29
  */

Codes/2147-number-of-ways-to-divide-a-long-corridor_Better.cpp

@@ -5,4 +5,4 @@
  * @LastEditTime: 2025-11-01 22:18:35
  */
 pub struct Solution;
-include!("3531-count-covered-buildings.rs");  // 这个fileName是会被脚本替换掉的
+include!("2110-number-of-smooth-descent-periods-of-a-stock.rs");  // 这个fileName是会被脚本替换掉的