差分数组学习

睿思佳

已于 2023-06-02 22:48:10 修改

阅读量64

点赞数

分类专栏： leetcode 文章标签：学习 leetcode 算法

于 2023-05-28 23:16:32 首次发布

本文链接：https://blog.csdn.net/qq_38256519/article/details/130918902

版权

leetcode 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

文章介绍了差分数组这一数据结构在处理频繁区间修改问题中的应用，特别是在航班预订统计的问题中。通过差分数组，可以高效地处理区间增加操作并快速恢复原数组。解决方案包括初始化差分数组，实现增加区间值和获取结果数组的方法。

摘要由CSDN通过智能技术生成

差分数组的主要适用场景是频繁对原始数组的某个区间的元素进行增减。

# 差分数组工具类
class Difference:
    # 差分数组
    def __init__(self, nums: List[int]):
        self.diff = [0] * len(nums)
        # 根据初始数组构造差分数组
        self.diff[0] = nums[0]
        for i in range(1, len(nums)):
            self.diff[i] = nums[i] - nums[i - 1]

    # 给闭区间 [i, j] 增加 val（可以是负数）
    def increment(self, i: int, j: int, val: int) -> None:
        self.diff[i] += val
        if j + 1 < len(self.diff):
            self.diff[j + 1] -= val

    # 返回结果数组
    def result(self) -> List[int]:
        res = [0] * len(self.diff)
        # 根据差分数组构造结果数组
        res[0] = self.diff[0]
        for i in range(1, len(self.diff)):
            res[i] = res[i - 1] + self.diff[i]
        return res

1109. 航班预订统计

class Difference:
    def __init__(self, nums: List[int]):
        n = len(nums)
        self.diff = [0] * n
        self.diff[0] = nums[0]
        for i in range(1, n):
            self.diff[i] = nums[i] - nums[i - 1]

    def increase(self, i, j, value):
        self.diff[i] += value
        if (j + 1) < len(self.diff):
            self.diff[j + 1] -= value

    def result(self) -> List[int]:
        n = len(self.diff)
        ans = [0] * n
        ans[0] = self.diff[0]
        for i in range(1, n):
            ans[i] = ans[i - 1] + self.diff[i]
        return ans



class Solution:
    def corpFlightBookings(self, bookings: List[List[int]], n: int) -> List[int]:
        nums = [0] * n
        diff = Difference(nums)
        for booking in bookings:
            i = booking[0] - 1
            j = booking[1] - 1
            diff.increase(i, j, booking[-1])
        return diff.result()