2017年7月5日
LeetCode 561. Array Partition I （数组分隔之一）
摘要： Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of 阅读全文
posted @ 2017-07-05 04:14 Jimmy_Cheng 阅读(2082) 评论(0) 推荐(1) 编辑
LeetCode 235. Lowest Common Ancestor of a Binary Search Tree （二叉搜索树最近的共同祖先）
摘要： Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the definition of LCA on Wikipedia 阅读全文
posted @ 2017-07-05 01:02 Jimmy_Cheng 阅读(264) 评论(0) 推荐(0) 编辑
2017年7月4日
LeetCode 226. Invert Binary Tree （反转二叉树）
摘要： Invert a binary tree. 4 / \ 2 7 / \ / \ 1 3 6 9 to 4 / \ 7 2 / \ / \ 9 6 3 1 Trivia:This problem was inspired by this original tweet by Max Howell: Go 阅读全文
posted @ 2017-07-04 23:18 Jimmy_Cheng 阅读(204) 评论(0) 推荐(0) 编辑
LeetCode 566. Reshape the Matrix （重塑矩阵）
摘要： In MATLAB, there is a very useful function called 'reshape', which can reshape a matrix into a new one with different size but keep its original data. 阅读全文
posted @ 2017-07-04 06:42 Jimmy_Cheng 阅读(632) 评论(0) 推荐(0) 编辑
LeetCode 112. Path Sum （二叉树路径之和）
摘要： Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. F 阅读全文
posted @ 2017-07-04 06:17 Jimmy_Cheng 阅读(269) 评论(0) 推荐(0) 编辑
LeetCode 111. Minimum Depth of Binary Tree （二叉树最小的深度）
摘要： Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest l 阅读全文
posted @ 2017-07-04 05:28 Jimmy_Cheng 阅读(282) 评论(0) 推荐(0) 编辑
LeetCode 110. Balanced Binary Tree （平衡二叉树）
摘要： Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the dept 阅读全文
posted @ 2017-07-04 00:36 Jimmy_Cheng 阅读(348) 评论(0) 推荐(0) 编辑
2017年7月3日
LeetCode 108. Convert Sorted Array to Binary Search Tree （有序数组转化为二叉搜索树）
摘要： Given an array where elements are sorted in ascending order, convert it to a height balanced BST. 题目标签：Tree 这道题目给了我们一个有序数组，从小到大。让我们把这个数组转化为height bala 阅读全文
posted @ 2017-07-03 02:41 Jimmy_Cheng 阅读(386) 评论(0) 推荐(0) 编辑
LeetCode 107. Binary Tree Level Order Traversal II （二叉树阶层顺序遍历之二）
摘要： Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For 阅读全文
posted @ 2017-07-03 00:41 Jimmy_Cheng 阅读(410) 评论(0) 推荐(0) 编辑
2017年7月2日
LeetCode 104. Maximum Depth of Binary Tree （二叉树的最大深度）
摘要： Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest l 阅读全文
posted @ 2017-07-02 06:32 Jimmy_Cheng 阅读(293) 评论(0) 推荐(0) 编辑