Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

feat: update lc problems #4119

Merged
merged 1 commit into from
Feb 28, 2025
Merged

feat: update lc problems #4119

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
183 changes: 63 additions & 120 deletions solution/2200-2299/2276.Count Integers in Intervals/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -99,46 +99,84 @@ countIntervals.count(); // 返回 8

```python
class Node:
def __init__(self):
self.tag = 0
self.tot = 0
__slots__ = ("left", "right", "l", "r", "mid", "v", "add")

def __init__(self, l, r):
self.left = None
self.right = None
self.l = l
self.r = r
self.mid = (l + r) // 2
self.v = 0
self.add = 0


def update(self, l, r, a, b):
if self.tag == 1:
class SegmentTree:
def __init__(self):
self.root = Node(1, int(1e9) + 1)

def modify(self, l, r, v, node=None):
if node is None:
node = self.root
if l > r:
return
mid = (a + b) >> 1
if l == a and r == b:
self.tag = 1
self.tot = b - a + 1
if node.l >= l and node.r <= r:
node.v = node.r - node.l + 1
node.add = v
return
if not self.left:
self.left = Node()
if not self.right:
self.right = Node()
if mid >= l:
self.left.update(l, min(mid, r), a, mid)
if mid + 1 <= r:
self.right.update(max(mid + 1, l), r, mid + 1, b)
self.tag = 0
self.tot = self.left.tot + self.right.tot
self.pushdown(node)
if l <= node.mid:
self.modify(l, r, v, node.left)
if r > node.mid:
self.modify(l, r, v, node.right)
self.pushup(node)

def query(self, l, r, node=None):
if node is None:
node = self.root
if l > r:
return 0
if node.l >= l and node.r <= r:
return node.v
self.pushdown(node)
v = 0
if l <= node.mid:
v += self.query(l, r, node.left)
if r > node.mid:
v += self.query(l, r, node.right)
return v

def pushup(self, node):
node.v = node.left.v + node.right.v

def pushdown(self, node):
if node.left is None:
node.left = Node(node.l, node.mid)
if node.right is None:
node.right = Node(node.mid + 1, node.r)
if node.add != 0:
left, right = node.left, node.right
left.add = node.add
right.add = node.add
left.v = left.r - left.l + 1
right.v = right.r - right.l + 1
node.add = 0


class CountIntervals:
def __init__(self):
self.tree = Node()
self.tree = SegmentTree()

def add(self, left: int, right: int) -> None:
self.tree.update(left, right, 0, 1000000010)
def add(self, left, right):
self.tree.modify(left, right, 1)

def count(self) -> int:
return self.tree.tot
def count(self):
return self.tree.query(1, int(1e9))


# Your CountIntervals object will be instantiated and called as such:
# obj = CountIntervals()
# obj.add(left,right)
# obj.add(left, right)
# param_2 = obj.count()
```

Expand Down Expand Up @@ -548,99 +586,4 @@ class CountIntervals {

<!-- solution:end -->

<!-- solution:start -->

### 方法二

<!-- tabs:start -->

#### Python3

```python
class Node:
__slots__ = ("left", "right", "l", "r", "mid", "v", "add")

def __init__(self, l, r):
self.left = None
self.right = None
self.l = l
self.r = r
self.mid = (l + r) // 2
self.v = 0
self.add = 0


class SegmentTree:
def __init__(self):
self.root = Node(1, int(1e9) + 1)

def modify(self, l, r, v, node=None):
if node is None:
node = self.root
if l > r:
return
if node.l >= l and node.r <= r:
node.v = node.r - node.l + 1
node.add = v
return
self.pushdown(node)
if l <= node.mid:
self.modify(l, r, v, node.left)
if r > node.mid:
self.modify(l, r, v, node.right)
self.pushup(node)

def query(self, l, r, node=None):
if node is None:
node = self.root
if l > r:
return 0
if node.l >= l and node.r <= r:
return node.v
self.pushdown(node)
v = 0
if l <= node.mid:
v += self.query(l, r, node.left)
if r > node.mid:
v += self.query(l, r, node.right)
return v

def pushup(self, node):
node.v = node.left.v + node.right.v

def pushdown(self, node):
if node.left is None:
node.left = Node(node.l, node.mid)
if node.right is None:
node.right = Node(node.mid + 1, node.r)
if node.add != 0:
left, right = node.left, node.right
left.add = node.add
right.add = node.add
left.v = left.r - left.l + 1
right.v = right.r - right.l + 1
node.add = 0


class CountIntervals:
def __init__(self):
self.tree = SegmentTree()

def add(self, left, right):
self.tree.modify(left, right, 1)

def count(self):
return self.tree.query(1, int(1e9))


# Your CountIntervals object will be instantiated and called as such:
# obj = CountIntervals()
# obj.add(left, right)
# param_2 = obj.count()
```

<!-- tabs:end -->

<!-- solution:end -->

<!-- problem:end -->
Loading