hope_worker的专栏

Question Say you have an array prices for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multip

class Solution: def islandPerimeter(self, grid: List[List[int]]) -> int: """ grid = [[0,1,0,0], [1,1,1,0], [0,1,0,0], [1,1,0,0]] """ ...

我想在Gatsby网站上创建Markdown页面时自动添加侧边栏。 有一个 starter “ gatsby-gitbook-starter” 可以支持markdown文件的侧边栏，但仅支持1级。 我希望能够支持更多级别。

1. question Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]). You are given a target value to search. If found in the array return its index, otherwise ret

""" step 1 : maintain the following structure a[l] ...... ,,,,,, < a[l] > a[l] j i step 2: in the end, swap(l, j), return j . .....a[l] ,,,,,, < a[l] > a[l] j i For examp

1. a[start:stop:step] q = "12345" w = q[0:2:1] # [0, 2) print(f"w: {w}") # w: 12 w = q[::-1] # if step is negative, reverse traverse print(f"w's type: {type(w)} w: {w}") # w's type: <class 'str'> w: 54321 w = q[::-2] print(f"w: {w}") # w: 531 2.

def findAnagrams_leetcode(self, s: str, p: str) -> List[int]: if len(s) < len(p): return [] p_chars = Counter(p) i = 0 j = len(p) window = Counter(s[i:j]) results = [] while j &...

leetcode 78 求解序列的所有子集。 例如： [1, 2, 3]. 所有子集为：[ [ ], [1], [2], [3], [1, 2], [1, 3], [2, 3], [1, 2, 3] ] 其中一种解题思路为： 使用2进制来表示，组合中是否包含某个元素。 例如 001–> [3], 101–>[1, 3], 111–>[1, 2, 3] 因此只有列出 [0, 2n) 的2进制表示，就可以求出所有的子集。 求解2进制表示时，有一个“zero left padd

def combine(self, n: int, k: int) -> List[List[int]]: """ Input: n = 4, k = 2 Output: [ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4], ] :param n:...

from collections import deque class TreeNode: def __init__(self, val=0, left=None, right=None): self.val = val self.left = left self.right = right class Solution: def printTreeCore(self, root, preorder=True): if not