mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-07-06 10:31:29 +08:00
isort --profile black . (#2181)
* updating DIRECTORY.md * isort --profile black . * Black after * updating DIRECTORY.md Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
@ -35,7 +35,7 @@ https://www.geeksforgeeks.org/segment-tree-efficient-implementation/
|
||||
>>> st.query(0, 2)
|
||||
[1, 2, 3]
|
||||
"""
|
||||
from typing import List, Callable, TypeVar
|
||||
from typing import Callable, List, TypeVar
|
||||
|
||||
T = TypeVar("T")
|
||||
|
||||
|
@ -3,9 +3,8 @@ Segment_tree creates a segment tree with a given array and function,
|
||||
allowing queries to be done later in log(N) time
|
||||
function takes 2 values and returns a same type value
|
||||
"""
|
||||
|
||||
from queue import Queue
|
||||
from collections.abc import Sequence
|
||||
from queue import Queue
|
||||
|
||||
|
||||
class SegmentTreeNode(object):
|
||||
|
Reference in New Issue
Block a user