话说,几天前,Max Howell(Homebrew的作者)去Google面试,Google就出了这个题,结果他竟然写不出来。。。
然后,他就在twitter上吐槽了:
Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so fuck off.
能碰到这题,应该是走运啊,但是他怎么就写不出来啊,估计是个失误吧。
后来Leetcode就加上这个题目,且看我是如何解答的。
题目: Invert a binary tree.
4
/ \
2 7
/ \ / \
1 3 6 9
to
4
/ \
7 2
/ \ / \
9 6 3 1
实现:
TreeNode* invertTree(TreeNode* root) {
if (root == NULL) return NULL;
TreeNode* temp = root->left;
root->left = root->right;
root->right = temp;
invertTree(root->left);
invertTree(root->right);
return root;
}
当然更好点写法:
TreeNode* invertTree(TreeNode* root) {
if (root == NULL) return NULL;
TreeNode* temp = invertTree(root->left);
root->left = invertTree(root->right);
root->right = temp;
return root;
}
有人就会问,那不用递归怎么写,没问题,看:
TreeNode* invertTree(TreeNode* root) {
if (root == NULL) return NULL;
std::queue<TreeNode*> q;
q.push(root);
while (q.size() > 0)
{
TreeNode* node = q.front();
q.pop();
if (node->left) {
q.push(node->left);
}
if (node->right) {
q.push(node->right);
}
std:swap(node->left, node->right);
}
return root;
}