leetcode
Chercheer
道阻且长
展开
-
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 · 513 阅读 · 0 评论 -
LeetCode566. Reshape the Matrix
【题目】:实现矩阵reshape操作,当reshape满足数组维度时返回结果,否则返回原数组即可。【示例】:Input: nums = [[1,2],[3,4]], r = 1, c = 4Output: [[1,2,3,4]]Input: nums = [[1,2], [3,4]],r = 2, c = 4 Output: [[1,2], [3,4]]【解法1】:原创 2017-05-14 22:38:15 · 681 阅读 · 0 评论 -
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 · 542 阅读 · 0 评论 -
LeetCode500. Keyboard Row
Given a List of words, return the words that can be typed using letters of alphabet on only one row's of American keyboard like the image below.【题目】对于输入的单词list,如果单词的每个字母都是在键盘上的一行内,则返回这种单词的list原创 2017-08-01 21:19:29 · 564 阅读 · 0 评论