Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 413 with 22 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 413 # by problem number
lcpy gen -s arithmetic_slices # by problem name
[1,3,5,7,9], [7,7,7,7], and [3,-1,-5,-9] are arithmetic sequences.nums, return the number of arithmetic subarrays of nums.
A subarray is a contiguous subsequence of the array.
Input: nums = [1,2,3,4]
Output: 3
Explanation: We have 3 arithmetic slices in nums: [1, 2, 3], [2, 3, 4] and [1,2,3,4] itself.
Input: nums = [1]
Output: 0
class Solution:
# Time: O(n)
# Space: O(1)
def number_of_arithmetic_slices(self, nums: list[int]) -> int:
total = 0
run = 0
for i in range(2, len(nums)):
if nums[i] - nums[i - 1] == nums[i - 1] - nums[i - 2]:
run += 1
total += run
else:
run = 0
return total
| Time | Space |
|---|---|
| O(n) | O(1) |