Class Solution

java.lang.Object
g0401_0500.s0413_arithmetic_slices.Solution

public class Solution extends Object
413 - Arithmetic Slices.<p>Medium</p> <p>An integer array is called arithmetic if it consists of <strong>at least three elements</strong> and if the difference between any two consecutive elements is the same.</p> <ul> <li>For example, <code>[1,3,5,7,9]</code>, <code>[7,7,7,7]</code>, and <code>[3,-1,-5,-9]</code> are arithmetic sequences.</li> </ul> <p>Given an integer array <code>nums</code>, return <em>the number of arithmetic <strong>subarrays</strong> of</em> <code>nums</code>.</p> <p>A <strong>subarray</strong> is a contiguous subsequence of the array.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,2,3,4]</p> <p><strong>Output:</strong> 3</p> <p><strong>Explanation:</strong> We have 3 arithmetic slices in nums: [1, 2, 3], [2, 3, 4] and [1,2,3,4] itself.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [1]</p> <p><strong>Output:</strong> 0</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 5000</code></li> <li><code>-1000 <= nums[i] <= 1000</code></li> </ul>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • numberOfArithmeticSlices

      public int numberOfArithmeticSlices(int[] nums)