class Solution {
public int numberOfArrays(int[] differences, int lower, int upper) {
long sumNum=0,minNum=0,maxNum=0;
for(int diff:differences){
sumNum+=diff;
minNum=Math.min(minNum,sumNum);
maxNum=Math.max(maxNum,sumNum);
}
return (int)Math.max(upper-lower-maxNum+minNum+1,0);
}
}
class Solution(object):
def numberOfArrays(self, differences, lower, upper):
sumNum,minNum,maxNum=0,0,0
for diff in differences:
sumNum+=diff
minNum=min(minNum,sumNum)
maxNum=max(maxNum,sumNum)
return max(upper-lower-maxNum+minNum+1,0)