摘要: https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/#/description 阅读全文
posted @ 2017-05-23 10:30 Sempron2800+ 阅读(196) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/kill-process/#/solutions tree中记录的是每个进程及其直接的子进程。然后在调用traverse方法,这个方法是递归的进行寻找,每个级别的进程及其子进程,将其全部加入到要删除的进程列表result中。 阅读全文
posted @ 2017-05-23 10:25 Sempron2800+ 阅读(350) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/fraction-addition-and-subtraction/#/description 阅读全文
posted @ 2017-05-23 09:44 Sempron2800+ 阅读(201) 评论(0) 推荐(0) 编辑