10 2014 档案

摘要:Given two sorted integer arrays A and B, merge B into A as one sorted array. Note: You may assume that A has enough space (size that is greater or equ 阅读全文
posted @ 2014-10-29 16:40 Mr.do 阅读(145) 评论(0) 推荐(0)
摘要:一、将下载后的文件解压到:E:\Opencv 二、配置opencv的环境变量:系统path添加 E:\Opencv\opencv\build\x86\vc11; E:\Opencv\opencv\build\common\tbb\ia32\vc11; E:\Opencv\opencv\build\x 阅读全文
posted @ 2014-10-29 11:46 Mr.do 阅读(560) 评论(0) 推荐(0)
摘要:Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 阅读全文
posted @ 2014-10-29 11:41 Mr.do 阅读(156) 评论(0) 推荐(0)
摘要: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 nearest l 阅读全文
posted @ 2014-10-28 09:56 Mr.do 阅读(132) 评论(0) 推荐(0)
摘要:问题: Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identic 阅读全文
posted @ 2014-10-27 09:21 Mr.do 阅读(119) 评论(0) 推荐(0)
摘要:题目:Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthes 阅读全文
posted @ 2014-10-26 13:19 Mr.do 阅读(107) 评论(0) 推荐(0)
摘要:题目:Sort a linked list using insertion sort. 阅读全文
posted @ 2014-10-26 09:50 Mr.do 阅读(128) 评论(0) 推荐(0)