05 2014 档案

66. 有序数组构造二叉搜索树[array to binary search tree]
摘要：array to binary search tree 阅读全文
posted @ 2014-05-31 09:27 hellogiser 阅读(526) 评论(0) 推荐(0)
65. 链表是否带环、环入口、环长度、链表相交问题分析与总结
摘要：linked list loop and intersections 阅读全文
posted @ 2014-05-31 08:20 hellogiser 阅读(2113) 评论(2) 推荐(3)
ReverseString
摘要：reverse string 阅读全文
posted @ 2014-05-30 15:52 hellogiser 阅读(330) 评论(0) 推荐(0)
64. 海明距离(Hamming Distance)
摘要：Hamming Distance 阅读全文
posted @ 2014-05-30 12:02 hellogiser 阅读(5031) 评论(0) 推荐(0)
Kmin
摘要：kmin-of-array 阅读全文
posted @ 2014-05-30 11:45 hellogiser 阅读(787) 评论(0) 推荐(0)
63.如何对单链表进行快排？和数组快排的分析与对比[quicksort of array and linked list]
摘要：quick sort of array and linked list 阅读全文
posted @ 2014-05-30 11:36 hellogiser 阅读(837) 评论(0) 推荐(0)
62. 链表重排[Reorder List]
摘要：reorder list 阅读全文
posted @ 2014-05-30 10:46 hellogiser 阅读(487) 评论(0) 推荐(0)
61. 从1到n，共有n个数字，每个数字只出现一次。从中随机拿走一个数字x，请给出最快的方法，找到这个数字。如果随机拿走k(k>=2)个数字呢？[find k missing numbers from 1 to n]
摘要：find k missing numbers from 1 to n. (k>=1) 阅读全文
posted @ 2014-05-29 21:44 hellogiser 阅读(1059) 评论(2) 推荐(0)
60. 数组中一个数字出现1次其它数字都出现了3次，如何找到该数字？
摘要：find number which appears 1 time while the remaining numbers appear 3 times. 阅读全文
posted @ 2014-05-28 21:31 hellogiser 阅读(1487) 评论(13) 推荐(1)
59. 总结篇：数组中N(n=1,2,3)个只出现一次的数字[find N numbers which appear only once in array]
摘要：find N (N=1,2,3) numbers which appear only once in array 阅读全文
posted @ 2014-05-27 16:58 hellogiser 阅读(681) 评论(0) 推荐(0)
原码/反码/补码详解
摘要：参见http://www.cnblogs.com/zhangziqiu/archive/2011/03/30/ComputerCode.html 阅读全文
posted @ 2014-05-27 10:53 hellogiser 阅读(158) 评论(0) 推荐(0)
58. 分析、测试与总结：罗马数字和阿拉伯数字的转换[roman to integer and integer to roman in c++]
摘要：roman to integer and integer to roman in c++ 阅读全文
posted @ 2014-05-27 08:11 hellogiser 阅读(1646) 评论(0) 推荐(0)
57. 数对之差的最大值：4种方法详解与总结[maximum difference of array]
摘要：maximum/largest difference of array 阅读全文
posted @ 2014-05-26 12:20 hellogiser 阅读(2646) 评论(0) 推荐(0)
28. 字符串的全排列之第2篇[string permutation with repeating chars]
摘要：string-permutation-with-repeating-chars 阅读全文
posted @ 2014-05-26 08:33 hellogiser 阅读(1001) 评论(0) 推荐(0)
56. 2种方法判断二叉树是不是平衡二叉树[is balanced tree]
摘要：is balanced tree 阅读全文
posted @ 2014-05-25 15:18 hellogiser 阅读(990) 评论(0) 推荐(0)
55. 2种方法求字符串的组合[string combination]
摘要：using recursive and bitwise methods to get string combinations. 阅读全文
posted @ 2014-05-25 08:50 hellogiser 阅读(1749) 评论(4) 推荐(0)
54. 八皇后问题[eight queens puzzle]
摘要：eight queens puzzle 阅读全文
posted @ 2014-05-24 20:13 hellogiser 阅读(1299) 评论(0) 推荐(0)
53. 特殊的O(n)时间排序[sort ages with hashtable]
摘要：sort ages with hashtable 阅读全文
posted @ 2014-05-24 14:47 hellogiser 阅读(338) 评论(0) 推荐(0)
52. 不用＋、－、×、÷做加法[add two numbers without arithmetic]
摘要：add two numbers without arithmetic 阅读全文
posted @ 2014-05-24 14:13 hellogiser 阅读(1195) 评论(5) 推荐(1)
C++基础知识面试精选100题系列(11-20题)[C++ basics]
摘要：100-interview-questions-of-cplusplus-basics 阅读全文
posted @ 2014-05-24 08:05 hellogiser 阅读(1787) 评论(6) 推荐(2)
C++基础知识面试精选100题系列(1-10题)[C++ basics]
摘要：100-interview-questions-of-cplusplus-basics 阅读全文
posted @ 2014-05-23 21:28 hellogiser 阅读(2160) 评论(4) 推荐(1)
51. 顺时针打印矩阵[print matrix in clockwise direction]
摘要：print matrix/2d-array in clockwise direction 阅读全文
posted @ 2014-05-23 19:52 hellogiser 阅读(990) 评论(6) 推荐(0)
50. 树的子结构[subtree structure in tree]
摘要：subtree structure in tree 阅读全文
posted @ 2014-05-23 18:07 hellogiser 阅读(557) 评论(0) 推荐(0)
49. 3种方法实现复杂链表的复制[clone of complex linked list]
摘要：clone of complex linked list. 阅读全文
posted @ 2014-05-23 11:55 hellogiser 阅读(1610) 评论(1) 推荐(0)
48. 二叉树两结点的最低共同父结点(3种变种情况)[Get lowest common ancestor of binary tree]
摘要：Get lowest common ancestor of binary tree. 阅读全文
posted @ 2014-05-22 15:43 hellogiser 阅读(746) 评论(0) 推荐(1)
47. 数组中出现次数超过一半的数字[Number appears more than half times]
摘要：Find number which appears more than half times of array length. 阅读全文
posted @ 2014-05-22 09:21 hellogiser 阅读(442) 评论(0) 推荐(0)
46. 对称子字符串的最大长度(ToDo)
摘要：Suffix Tree to get maximum symmetrical sub-string. 阅读全文
posted @ 2014-05-21 20:33 hellogiser 阅读(265) 评论(0) 推荐(0)
45. Singleton类的C++/C#实现[Singleton]
摘要：Implementation of singleton in C++/C#. 阅读全文
posted @ 2014-05-21 19:51 hellogiser 阅读(290) 评论(0) 推荐(0)
44. log(n)求a的n次方[power(a,n)]
摘要：Calculate a^n in log(n). 阅读全文
posted @ 2014-05-21 18:14 hellogiser 阅读(347) 评论(0) 推荐(0)
43. 动态规划求解n个骰子的点数和出现概率(或次数)[Print sum S probability of N dices]
摘要：Print sum S probability of N dices. 阅读全文
posted @ 2014-05-21 16:23 hellogiser 阅读(502) 评论(0) 推荐(0)
42.旋转数组的最小元素[Get min value of rotated array]
摘要：Get min value or smallest number of rotated array. 阅读全文
posted @ 2014-05-21 10:14 hellogiser 阅读(236) 评论(0) 推荐(0)
41.把数组排成最小的数[Sort array to smallest value]
摘要：Sort array to min or smallest value. 阅读全文
posted @ 2014-05-20 19:43 hellogiser 阅读(432) 评论(0) 推荐(0)
40.扑克牌的顺子[Continuous cards]
摘要：Continuous cards. 阅读全文
posted @ 2014-05-20 14:50 hellogiser 阅读(403) 评论(0) 推荐(0)
39.递归颠倒栈[ReverseStack]
摘要：Reverse a stack. 阅读全文
posted @ 2014-05-20 14:48 hellogiser 阅读(417) 评论(0) 推荐(0)
38.输出1到最大的N位数[Print 1 to max number of N bits]
摘要：Print 1 to max number of N bits. 阅读全文
posted @ 2014-05-20 14:47 hellogiser 阅读(399) 评论(0) 推荐(0)
37.寻找丑数[Ugly numbers]
摘要：Ugly numbers. 阅读全文
posted @ 2014-05-20 14:45 hellogiser 阅读(394) 评论(0) 推荐(0)
36.在字符串中删除特定的字符[Delete source from dest]
摘要：Delete given chars from source string in O(n). 阅读全文
posted @ 2014-05-20 14:43 hellogiser 阅读(398) 评论(0) 推荐(0)
35.两链表的第一个公共结点[Find the first common node of two linked list]
摘要：Find the first common node of two linked list. 阅读全文
posted @ 2014-05-20 14:40 hellogiser 阅读(576) 评论(0) 推荐(0)
34.数组中2个只出现一次的数字[Find two numbers which appear once]
摘要：Find a number which appears once in an array with all the other numbers appear twice. 阅读全文
posted @ 2014-05-20 14:38 hellogiser 阅读(391) 评论(0) 推荐(0)
33.在O(1)时间删除链表结点[DeleteListNode]
摘要：Delete node in linked list in O(1). 阅读全文
posted @ 2014-05-20 14:35 hellogiser 阅读(370) 评论(0) 推荐(0)
32.C++不能被继承的类[C++ Final Class]
摘要：A C++ final class. 阅读全文
posted @ 2014-05-20 14:31 hellogiser 阅读(814) 评论(0) 推荐(0)
31.从尾到头输出链表[Print linked list from last to first]
摘要：Print a linked list from last to first. 阅读全文
posted @ 2014-05-20 14:28 hellogiser 阅读(320) 评论(0) 推荐(0)
30.赋值运算符重载函数[Assign copy constructor]
摘要：Assign copy constructor. 阅读全文
posted @ 2014-05-20 14:24 hellogiser 阅读(254) 评论(0) 推荐(0)
29.调整数组顺序使奇数位于偶数前面[ReOrderArray]
摘要：Reorder an array so that odd numbers come before even numbers. 阅读全文
posted @ 2014-05-20 14:20 hellogiser 阅读(402) 评论(0) 推荐(0)
28. 字符串的排列之第1篇[StringPermutation]
摘要：String's permutation. 阅读全文
posted @ 2014-05-20 14:16 hellogiser 阅读(477) 评论(0) 推荐(0)
27.二元树的深度[BinaryTreeDepth]
摘要：Binary tree's depth or height. 阅读全文
posted @ 2014-05-20 14:12 hellogiser 阅读(565) 评论(0) 推荐(0)
26.打印所有和为S的连续正整数序列[FindContinuousSequencesWithSumS]
摘要：Find continuous sequences between 1 to N whose sum equals to S. 阅读全文
posted @ 2014-05-20 14:11 hellogiser 阅读(310) 评论(0) 推荐(0)
25.在从1到n的正数中1出现的次数[NumberOf1Between1_N]
摘要：Number of 1 between 1 to N. 阅读全文
posted @ 2014-05-20 14:07 hellogiser 阅读(334) 评论(0) 推荐(0)
24.栈的push和pop序列[StackPushPopSequence]
摘要：Stack's push pop sequences. 阅读全文
posted @ 2014-05-20 14:03 hellogiser 阅读(427) 评论(0) 推荐(0)
23.跳台阶问题[Fib]
摘要：DP and Fib. 阅读全文
posted @ 2014-05-20 14:02 hellogiser 阅读(317) 评论(0) 推荐(0)
22.整数二进制表示中1的个数[Get1BitCount]
摘要：The number of 1 bits in an integer. 阅读全文
posted @ 2014-05-20 14:00 hellogiser 阅读(295) 评论(0) 推荐(0)
21.左旋转字符串[LeftRotateString]
摘要：Left rotate a string. 阅读全文
posted @ 2014-05-20 13:57 hellogiser 阅读(406) 评论(0) 推荐(0)
20. 最长公共子串(ToDo)[LCS]
摘要：Longest common string(LCS). 阅读全文
posted @ 2014-05-20 13:54 hellogiser 阅读(151) 评论(0) 推荐(0)
19.递归法和非递归法反转链表[ReverseLinkedList]
摘要：Reverse a linked list. 阅读全文
posted @ 2014-05-20 13:52 hellogiser 阅读(244) 评论(0) 推荐(0)
18.用两个栈实现队列[2StacksToImplementQueue]
摘要：2 stacks to implement a queue. 阅读全文
posted @ 2014-05-20 13:50 hellogiser 阅读(194) 评论(0) 推荐(0)
17.把字符串转换成整数[atoi]
摘要：String to integer(atoi). 阅读全文
posted @ 2014-05-20 13:44 hellogiser 阅读(266) 评论(0) 推荐(0)
16.O(logn)求Fibonacci数列[Fibonacci]
摘要：Dynamic programming and meta-programming to calculate Fib arrays. 阅读全文
posted @ 2014-05-20 13:41 hellogiser 阅读(265) 评论(0) 推荐(0)
15.含有指针成员的类的拷贝[ClassCopyConstructorWithPointerMember]
摘要：C++ string class copy constructor and assign constructor. 阅读全文
posted @ 2014-05-20 13:35 hellogiser 阅读(267) 评论(0) 推荐(0)
14.约瑟夫环问题[JosephusProblem]
摘要：Josephus problem. 阅读全文
posted @ 2014-05-20 13:27 hellogiser 阅读(259) 评论(0) 推荐(0)
13.第一个只出现一次的字符[FindFirstNotRepeatingChar]
摘要：Find first not repeating char in a string. 阅读全文
posted @ 2014-05-20 13:17 hellogiser 阅读(294) 评论(0) 推荐(0)
12.从上往下遍历二元树[LevelOrderOfBinaryTree]
摘要：Visit a tree by level,namely BFS. 阅读全文
posted @ 2014-05-20 13:15 hellogiser 阅读(194) 评论(0) 推荐(0)
11.求二元查找树的镜像[MirrorOfBST]
摘要：Mirror a binary search tree. 阅读全文
posted @ 2014-05-20 13:10 hellogiser 阅读(233) 评论(0) 推荐(0)
10.排序数组中和为给定值的两个数字[Find2NumbersWithGivenSum]
摘要：Find 2 numbers with given sum in sorted array. 阅读全文
posted @ 2014-05-20 13:03 hellogiser 阅读(241) 评论(0) 推荐(0)
9.链表中倒数第k个结点[FindReverseKthLinkedListNode]
摘要：Find the inverse Kth node of a linked list. 阅读全文
posted @ 2014-05-20 11:24 hellogiser 阅读(261) 评论(0) 推荐(0)
8.另类方法求1+2+...+n[AnotherMethodOfCalculateSumN]
摘要：Another way to calculate sum of 1 to N. 阅读全文
posted @ 2014-05-20 11:18 hellogiser 阅读(301) 评论(0) 推荐(0)
7.翻转句子中单词的顺序[ReverseWordOrderInSentence]
摘要：Reverse the word order in a sentence, but maintain the character order inside a word. 阅读全文
posted @ 2014-05-20 11:11 hellogiser 阅读(474) 评论(0) 推荐(0)
6.二元查找树的后序遍历结果[PostOrderOfBST]
摘要：Verify post-order sequence of binary search tree. 阅读全文
posted @ 2014-05-20 11:05 hellogiser 阅读(188) 评论(0) 推荐(0)
5.查找最小的k个元素[Kmin]
摘要：Find K least numbers. 阅读全文
posted @ 2014-05-20 10:50 hellogiser 阅读(353) 评论(0) 推荐(0)
4.在二元树中找出和为某一值的所有路径[FindPathsInBinaryTree]
摘要：Find paths whose node values equal to N in binary tree. 阅读全文
posted @ 2014-05-20 10:36 hellogiser 阅读(228) 评论(0) 推荐(0)
3.子数组的最大和[MaximumContinuousSubArray]
摘要：Maximum continuous sub-array. 阅读全文
posted @ 2014-05-20 10:26 hellogiser 阅读(287) 评论(0) 推荐(0)
2.设计包含 min 函数的栈[StackWithMinValue]
摘要：Stack with min value. 阅读全文
posted @ 2014-05-20 10:03 hellogiser 阅读(212) 评论(1) 推荐(0)
1.把二元查找树转变成排序的双向链表[BST2DoubleLinkedList]
摘要：Binary search tree to sorted double linked list. 阅读全文
posted @ 2014-05-20 09:16 hellogiser 阅读(241) 评论(0) 推荐(0)