![](https://i-blog.csdnimg.cn/direct/89867dbf10de445883647de2eee8fd2d.png)
class Solution {public int numberOfArithmeticSlices(int[] nums) {int le=nums.length;if(le<3){return 0;}int arith=0,res=0,count=0;//arith是差的大小,res是结果,count计算等差数量for(int i=1;i<le;i++){if(nums[i]-nums[i-1]==arith){count++;if(count>=2){res+=count-1;}}else{count=1;arith=nums[i]-nums[i-1];}}return res;}
}
class Solution(object):def numberOfArithmeticSlices(self, nums):le=len(nums)if le<3:return 0arith,res,count=0,0,0#arith是差的大小,res是结果,count计算等差数量for i in range(1,le):if nums[i]-nums[i-1]==arith:count+=1if count>=2:res+=count-1else:count=1arith=nums[i]-nums[i-1]return res
var numberOfArithmeticSlices = function(nums) {var le=nums.length;if(le<3){return 0;}var arith=0,res=0,count=0;//arith是差的大小,res是结果,count计算等差数量for(var i=1;i<le;i++){if(nums[i]-nums[i-1]==arith){count++;if(count>=2){res+=count-1;}}else{count=1;arith=nums[i]-nums[i-1];}}return res;
};