摘要：
没搞懂 1、 Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the ne 阅读全文
posted @ 2016-03-28 16:31
自朗活
阅读(101)
评论(0)
推荐(0)
摘要：
1、 Merge two sorted (ascending) linked lists and return it as a new sorted list. The new sorted list should be made by splicing together the nodes of 阅读全文
posted @ 2016-03-28 16:22
自朗活
阅读(140)
评论(0)
推荐(0)
摘要：
1、 Given two sorted integer arrays A and B, merge B into A as one sorted array. A = [1, 2, 3, empty, empty], B = [4, 5] After merge, A will be filled 阅读全文
posted @ 2016-03-28 16:07
自朗活
阅读(155)
评论(0)
推荐(0)
摘要：
1、 Merge two given sorted integer array A and B into a new sorted integer array. A=[1,2,3,4] B=[2,4,5,6] return [1,2,2,3,4,4,5,6] 2、思路 1、创建一个大集合 2、判断， 阅读全文
posted @ 2016-03-28 16:01
自朗活
阅读(101)
评论(0)
推荐(0)
浙公网安备 33010602011771号