力扣刷题笔记

≈1.如何将矩阵转化为数组：

# itertools
	import itertools
	jz=[
	    [1,2,3],
	    [2,3,4],
	    [5,6,7]
	]
	cur=list()
	for i in itertools.chain.from_iterable(jz):
	    cur.append(i)
	print(cur)

# numpy
    import numpy as np
    row, col = len(jz), len(jz[0])
    return np.reshape(jz, (r, c)).tolist()

# 神奇的转变
	nums_reshape =  [num  for rows in jz for num in rows]
	print(nums_reshape)

# sum函数
	nums_reshape=sum(jz,[])

2. 递归模版

	def recursion(level,param1,param2,...):
		# 递归终结条件
		if level>MAX_LEVEL:
			process_result
			return

		#处理当前层逻辑
		process(level,data...)
		
		#下探到下一层
		self.recursion(level+1,p1,...)

3. 巧用字典哈希

	str='aasdfaa'
	for i in str:
		dic[i]=dic.get(i,0)+1
	#dic={'a':4,'s':1,'d':1,'f':1}

4. JS中Array构建二维数组

//n行target+1列的二维数组
const dp = new Array(n).fill(0).map(v => new Array(target + 1, false));

    let arr = (new Array(5).fill(0)).map((v,index)=>{
   		return new Array(7).fill(0)
    })