https://leetcode.com/problems/shortest-unsorted-continuous-subarray
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def findUnsortedSubarray(self, nums: List[int]) -> int:
mini = math.inf
maxi = -math.inf
flag = False
for i in range(1, len(nums)):
if nums[i] < nums[i - 1]:
flag …Category: leetcode
Read Morehttps://leetcode.com/problems/kill-process
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def killProcess(self, pid: List[int], ppid: List[int], kill: int) -> List[int]:
ans = []
tree = defaultdict(list)
for v, u in zip(pid, ppid):
if u == 0:
continue
tree …Category: leetcode
Read Morehttps://leetcode.com/problems/delete-operation-for-two-strings
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def minDistance(self, word1: str, word2: str) -> int:
m = len(word1)
n = len(word2)
dp = [0] * (n + 1)
for j in range(n + 1):
dp[j] = j
for i …Category: leetcode
Read Morehttps://leetcode.com/problems/erect-the-fence
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def outerTrees(self, trees: List[List[int]]) -> List[List[int]]:
hull = []
trees.sort(key=lambda x: (x[0], x[1]))
def cross(p: List[int], q: List[int], r …Category: leetcode
Read Morehttps://leetcode.com/problems/spiral-matrix-ii
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def generateMatrix(self, n: int) -> List[List[int]]:
ans = [[0] * n for _ in range(n)]
count = 1
for min in range(n // 2):
max = n - min - 1
for …Category: leetcode
Read Morehttps://leetcode.com/problems/tag-validator
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def isValid(self, code: str) -> bool:
if code[0] != '<' or code[-1] != '>':
return False
containsTag = False
stack = []
def isValidCdata(s: str) -> bool:
return s.find('[CDATA[') == 0
def isValidTagName …Category: leetcode
Read Morehttps://leetcode.com/problems/fraction-addition-and-subtraction
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def fractionAddition(self, expression: str) -> str:
ints = list(map(int, re.findall('[+-]?[0-9]+', expression)))
A = 0
B = 1
for a, b in zip(ints[::2], ints[1::2]):
A …Category: leetcode
Read Morehttps://leetcode.com/problems/valid-square
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def validSquare(self, p1: List[int], p2: List[int], p3: List[int], p4: List[int]) -> bool:
def dist(p1: List[int], p2: List[int]) -> int:
return (p1[0] - p2 …Category: leetcode
Read Morehttps://leetcode.com/problems/longest-harmonious-subsequence
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def findLHS(self, nums: List[int]) -> int:
ans = 0
count = Counter(nums)
for num, freq in count.items():
if num + 1 in count:
ans = max(ans, freq + count[num …Category: leetcode
Read Morehttps://leetcode.com/problems/range-addition-ii
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def maxCount(self, m: int, n: int, ops: List[List[int]]) -> int:
minY = m
minX = n
for y, x in ops:
minY = min(minY, y)
minX = min(minX, x …Category: leetcode
Read More