KK's blog

LeetCode

<div class="_1l1MA">

Given the root of a binary tree, return the inorder traversal of its nodes' values.

Example 1:

<pre>Input: root = [1,null,2,3] Output: [1,3,2] </pre>

Example 2:

<pre>Input: root = [] Output: [] </pre>

Example 3:

<pre>Input: root = [1] Output: [1] </pre>

Constraints:

• The number of nodes in the tree is in the range [0, 100].
• -100 <= Node.val <= 100

Follow up: Recursive solution is trivial, could you do it iteratively?</div>

题目大意：

求树的中序遍历

解题思路：

DFS

解题步骤：

N/A

注意事项：

N/A

Python代码：

1
2
3
4
5
6
7

def inorderTraversal(self, root: TreeNode) -> List[int]:
	return self.dfs(root)

def dfs(self, root):
	if not root:
		return []
	return self.dfs(root.left) + [root.val] + self.dfs(root.right)

算法分析：

时间复杂度为O(n)，空间复杂度O(1)

LeetCode

<div class="_1l1MA">

Given the root of a binary tree, return the preorder traversal of its nodes' values.

Example 1:

<pre>Input: root = [1,null,2,3] Output: [1,2,3] </pre>

Example 2:

<pre>Input: root = [] Output: [] </pre>

Example 3:

<pre>Input: root = [1] Output: [1] </pre>

Constraints:

• The number of nodes in the tree is in the range [0, 100].
• -100 <= Node.val <= 100

Follow up: Recursive solution is trivial, could you do it iteratively?

</div>

题目大意：

求树的前序遍历

解题思路：

DFS

解题步骤：

N/A

注意事项：

N/A

Python代码：

1
2
3
4
5
6
7

def preorderTraversal(self, root: TreeNode) -> List[int]:
	return self.dfs(root)

def dfs(self, root):
	if not root:
		return []
	return [root.val] + self.dfs(root.left) + self.dfs(root.right)

算法分析：

时间复杂度为O(n)，空间复杂度O(1)

LeetCode

<div class="_1l1MA">

Given the root of an n-ary tree, return the preorder traversal of its nodes' values.

Nary-Tree input serialization is represented in their level order traversal. Each group of children is separated by the null value (See examples)

Example 1:

<pre>Input: root = [1,null,3,2,4,null,5,6] Output: [1,3,5,6,2,4] </pre>

Example 2:

<pre>Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14] Output: [1,2,3,6,7,11,14,4,8,12,5,9,13,10] </pre>

Constraints:

• The number of nodes in the tree is in the range [0, 10<sup>4</sup>].
• 0 <= Node.val <= 10<sup>4</sup>
• The height of the n-ary tree is less than or equal to 1000.

Follow up: Recursive solution is trivial, could you do it iteratively?

</div>

题目大意：

求n个儿子的树的前序遍历

DFS解题思路：

严格按照定义，先root，再加入儿子节点

解题步骤：

N/A

注意事项：

1. root.children可能为None，所以要default成[]

Python代码：

1
2
3
4
5
6
7
8
9
10

def preorder(self, root: 'Node') -> List[int]:
	return self.dfs(root)

def dfs(self, root):
	if not root:
		return []
	res = [root.val]
	for child in root.children or []:
		res.extend(self.dfs(child))
	return res

算法分析：

时间复杂度为O(n)，空间复杂度O(1)

迭代算法II解题思路：

用stack，但不能用模板，因为太多儿子，所以类似于Iterator方法Leetcode 341 Flatten Nested List Iterator ，先把该层的儿子节点反着加入到stack，保证后加入的后遍历。

Python代码：

1
2
3
4
5
6
7
8
9
10
11
12

def iterative_preorder(self, root: 'Node') -> List[int]:
	if not root:
		return []
	res, stack = [], []
	stack.append(root)

	while stack:
		node = stack.pop()
		res.append(node.val)
		for child in reversed(node.children or []):
			stack.append(child)
	return res

算法分析：

时间复杂度为O(n)，空间复杂度O(n)。

LeetCode

<div class="_1l1MA">

You are given an m x n binary matrix mat of 1's (representing soldiers) and 0's (representing civilians). The soldiers are positioned in front of the civilians. That is, all the 1's will appear to the left of all the 0's in each row.

A row i is weaker than a row j if one of the following is true:

• The number of soldiers in row i is less than the number of soldiers in row j.
• Both rows have the same number of soldiers and i < j.

Return the indices of the k weakest rows in the matrix ordered from weakest to strongest.

Example 1:

<pre>Input: mat = [[1,1,0,0,0], [1,1,1,1,0], [1,0,0,0,0], [1,1,0,0,0], [1,1,1,1,1]], k = 3 Output: [2,0,3] Explanation: The number of soldiers in each row is:

• Row 0: 2
• Row 1: 4
• Row 2: 1
• Row 3: 2
• Row 4: 5 The rows ordered from weakest to strongest are [2,0,3,1,4]. </pre>

Example 2:

<pre>Input: mat = [[1,0,0,0], [1,1,1,1], [1,0,0,0], [1,0,0,0]], k = 2 Output: [0,2] Explanation: The number of soldiers in each row is:

• Row 0: 1
• Row 1: 4
• Row 2: 1
• Row 3: 1 The rows ordered from weakest to strongest are [0,2,3,1]. </pre>

Constraints:

• m == mat.length
• n == mat[i].length
• 2 <= n, m <= 100
• 1 <= k <= m
• matrix[i][j] is either 0 or 1.

</div>

题目大意：

二维数组含0和1，1表示士兵，0表示平民。每一行定义弱度，若士兵个数少且行号靠前，较弱。求前k个较弱的行号。

解题思路：

Easy题。Q&A的题目，关于前k个最值，第一时间想到用heap。求最小值，所以用最大堆

解题步骤：

N/A

注意事项：

1. 求最大堆，引入负值。此题属于二维堆，第二个维度跟第一个维度一样，从小到大，所以也采用负号。

Python代码：

1
2
3
4
5
6
7
8
9
10
11
12

def kWeakestRows(self, mat: List[List[int]], k: int) -> List[int]:
	nums_soldiers = [(sum(mat[i]), i) for i in range(len(mat))]
	res = []
	for i in range(len(nums_soldiers)):
		if i < k:
			heappush(res, (-nums_soldiers[i][0], -nums_soldiers[i][1]))
		# put into the heap if weaker
		elif -nums_soldiers[i][0] > res[0][0] or \
				(nums_soldiers[i][0] == res[0][0] and -nums_soldiers[i][1] > res[0][1]):
			heapreplace(res, (-nums_soldiers[i][0], -nums_soldiers[i][1]))
	res.sort(key=lambda x: (-x[0], -x[1]))
	return [-res[i][1] for i in range(len(res))]

算法分析：

时间复杂度为O(nlogk)，空间复杂度O(n), n为行数

LeetCode

<div class="_1l1MA">

You have a 2-D grid of size m x n representing a box, and you have n balls. The box is open on the top and bottom sides.

Each cell in the box has a diagonal board spanning two corners of the cell that can redirect a ball to the right or to the left.

• A board that redirects the ball to the right spans the top-left corner to the bottom-right corner and is represented in the grid as 1.
• A board that redirects the ball to the left spans the top-right corner to the bottom-left corner and is represented in the grid as -1.

We drop one ball at the top of each column of the box. Each ball can get stuck in the box or fall out of the bottom. A ball gets stuck if it hits a "V" shaped pattern between two boards or if a board redirects the ball into either wall of the box.

Return an array answer of size n where answer[i] is the column that the ball falls out of at the bottom after dropping the ball from the i<sup>th</sup> column at the top, or -1 if the ball gets stuck in the box.

Example 1:

<pre>Input: grid = [[1,1,1,-1,-1],[1,1,1,-1,-1],[-1,-1,-1,1,1],[1,1,1,1,-1],[-1,-1,-1,-1,-1]] Output: [1,-1,-1,-1,-1] Explanation: This example is shown in the photo. Ball b0 is dropped at column 0 and falls out of the box at column 1. Ball b1 is dropped at column 1 and will get stuck in the box between column 2 and 3 and row 1. Ball b2 is dropped at column 2 and will get stuck on the box between column 2 and 3 and row 0. Ball b3 is dropped at column 3 and will get stuck on the box between column 2 and 3 and row 0. Ball b4 is dropped at column 4 and will get stuck on the box between column 2 and 3 and row 1. </pre>

Example 2:

<pre>Input: grid = [[-1]] Output: [-1] Explanation: The ball gets stuck against the left wall. </pre>

Example 3:

<pre>Input: grid = [[1,1,1,1,1,1],[-1,-1,-1,-1,-1,-1],[1,1,1,1,1,1],[-1,-1,-1,-1,-1,-1]] Output: [0,1,2,3,4,-1] </pre>

Constraints:

• m == grid.length
• n == grid[i].length
• 1 <= m, n <= 100
• grid[i][j] is 1 or -1.

</div>

题目大意：

二维数组每一个cell都是1或者-1，分别表示一个玻璃板的放置方向，正对角线或者反对角线。球从每一个列投下，根据玻璃板的设置，若成功从底部滑出，输入列号，否则输入-1. 求这个结果数组。

解题思路：

这是Q&A题目。游戏模拟题大多用DFS，因为就是选择一条路径走到底。

解题步骤：

N/A

注意事项：

1. 任何情况都是row + 1，而不是-1
2. 题目要求若成功，输出球跌出的列号，而不是boolean = 1

Python代码：

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

def findBall(self, grid: List[List[int]]) -> List[int]:
	return [self.dfs(grid, 0, j) for j in range(len(grid[0]))]

def dfs(self, grid, row, col):
	if row == len(grid):
		return col
	if grid[row][col] == 1:
		if col + 1 == len(grid[0]) or grid[row][col + 1] == -1:
			return -1
		else:
			return self.dfs(grid, row + 1, col + 1)
	else:
		if col - 1 < 0 or grid[row][col - 1] == 1:
			return -1
		else:
			return self.dfs(grid, row + 1, col - 1)

算法分析：

时间复杂度为O(nm)，空间复杂度O(1), n, m分别为行数和列数。