09 2017 档案

Week3 - 397. Integer Replacement
摘要：Week3 397. Integer Replacement 397.Integer Replacement Medium Given a positive integer n and you can do operations as follow: 1.If n is even, replace 阅读全文
posted @ 2017-09-24 18:34 JerryChan31 阅读(160) 评论(0) 推荐(0) 编辑
Week2 - 669. Trim a Binary Search Tree & 617. Merge Two Binary Trees
摘要：Week2 669. Trim a Binary Search Tree & 617. Merge Two Binary Trees 669.Trim a Binary Search Tree Given a binary search tree and the lowest and highest 阅读全文
posted @ 2017-09-17 23:54 JerryChan31 阅读(127) 评论(0) 推荐(0) 编辑
Week1 - 169.Majority Element
摘要：这周刚开始讲了一点Divide and Conquer的算法，于是这周的作业就选择在LeetCode上找分治法相关的题目来做。 169.Majority Element Given an array of size n, find the majority element. The majority 阅读全文
posted @ 2017-09-10 22:25 JerryChan31 阅读(143) 评论(0) 推荐(0) 编辑