0 .差分配列概念：常用于某区间值需要加/减a的问题。
1. 1094拼车class solution 3360 def car轮询(self， trips: List[List[int]]、capacity : int (-bool : max _ val=0foriinrange (len (trips ) ) : max _ val trips[i][2] ) diff=[0]*(max_val2) forIinrange(len(trips ) ) :diff(trips[I] )1) nrd jmg=trips sum _ val=0flag=trueforiinrange (len (diff ) ) : sum_val =diff[i] if sum _ val capacity : flag=falsebreakreturnflag 2.1109航班预定统计class解决方案： defcorpflightbookings (self， bookings 3360 llag n : int (-list [ int ] : diff=[0] * ) n2 ) RES=[0] * nsum _ val=0foriinrange (len ) forIinrange[1，n1 ] : sum _ val=diff [ I ] RES [ I-1 ]=sum _ valreturnres 1674 .互补数组的最小操作数class solution 3360 deff num moves limit 3360 int (-int : diff=[0forIinrange )2* limit2] ] n=len (nums ) foriinrange ) n//2) 3360a=nums -=2L=1min(a，b ) r=limit max(A ) a， b ) diff(L )=1diff ) R1 nrd jmg=1diff (ab )=1diff ) a B1 nrd jmg=1print (diff ) res=n sum_val=0 for j in range(2)