摘要: 题目:You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a sing... 阅读全文
posted @ 2014-07-03 23:00 平凡的幸福... 阅读(820) 评论(0) 推荐(0) 编辑
摘要: 二分查找 阅读全文
posted @ 2014-07-03 15:31 平凡的幸福... 阅读(1286) 评论(7) 推荐(0) 编辑
摘要: 题目:Follow up for "Search in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time complexity? How and why?Write a function... 阅读全文
posted @ 2014-07-03 15:26 平凡的幸福... 阅读(161) 评论(0) 推荐(0) 编辑
摘要: 题目:Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).You are given a target valu... 阅读全文
posted @ 2014-07-03 15:01 平凡的幸福... 阅读(207) 评论(0) 推荐(0) 编辑
摘要: 题目:Follow up for "Remove Duplicates":What if duplicates are allowed at mosttwice?For example,Given sorted array A =[1,1,1,2,2,3],Your function should ... 阅读全文
posted @ 2014-07-02 20:54 平凡的幸福... 阅读(146) 评论(0) 推荐(0) 编辑
摘要: 题目:Given a sorted array, remove the duplicates in place such that each element appear onlyonceand return the new length.Do not allocate extra space fo... 阅读全文
posted @ 2014-07-02 20:51 平凡的幸福... 阅读(159) 评论(0) 推荐(0) 编辑
摘要: 题目:Given a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For ... 阅读全文
posted @ 2014-06-30 21:04 平凡的幸福... 阅读(289) 评论(0) 推荐(0) 编辑
摘要: 题目:Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree{3,... 阅读全文
posted @ 2014-06-30 20:17 平凡的幸福... 阅读(258) 评论(0) 推荐(0) 编辑
摘要: 说明:本文全文转载而来,原文链接:http://www.cppblog.com/wanghaiguang/archive/2012/06/05/177644.htmlC++ Queues(队列)C++队列是一种容器适配器,它给予程序员一种先进先出(FIFO)的数据结构。1.back() 返回一个引用... 阅读全文
posted @ 2014-06-26 21:19 平凡的幸福... 阅读(2403) 评论(0) 推荐(0) 编辑
摘要: 题目:Given a binary tree, return thepostordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[3,2,1]... 阅读全文
posted @ 2014-06-25 21:39 平凡的幸福... 阅读(427) 评论(0) 推荐(0) 编辑