摘要: Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: All root-to-leaf paths are: 题目标签:Tree 这道题目给了我们一个二叉树, 阅读全文
posted @ 2017-07-05 19:33 Jimmy_Cheng 阅读(198) 评论(0) 推荐(0) 编辑
摘要: 因为在开始写这个博客之前,已经刷了100题了,所以现在还是有很多题目没有加进来,为了方便查找哪些没加进来,先列一个表可以比较清楚的查看,也方便给大家查找。如果有哪些题目的链接有错误,请大家留言和谅解,链多了会眼花。 # Title Category Difficulty 1528 Shuffle S 阅读全文
posted @ 2017-07-05 06:47 Jimmy_Cheng 阅读(2466) 评论(0) 推荐(0) 编辑
摘要: 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 阅读(2084) 评论(0) 推荐(1) 编辑
摘要: 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 阅读(268) 评论(0) 推荐(0) 编辑