Carol 数组难题：Python 求解不稳定子数组数量

以下是使用 Python 解决此问题的代码： ```python def count_unstable_subarrays(a): n = len(a) count = 0 for l in range(n): for r in range(l, n): f = 0 for i in range(l, r): f += (a[i] - a[i + 1]) if f!= (a[r] - a[l]): count += 1 return count ``` ######[AI问答 | 112点数解答 | 2025-05-22 17:26:54]