- 博客(2)
- 资源 (1)
- 收藏
- 关注
原创 LeetCode561. 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 min(ai, bi) for all i from 1 to n as large as po
2017-07-31 20:52:41 539
原创 LeetCode617. Merge Two Binary Trees
Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not. You need to merge them into a new binary tree
2017-07-31 19:52:09 511
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人