还不错的技术博客

http://dreamrunner.org/

Comments

Post a Comment

Popular posts from this blog

Unique Binary Search Trees

/*** Given  n , how many structurally unique  BST's  (binary search trees) that store values 1... n ? For example, Given  n  = 3, there are a total of 5 unique BST's.    1         3     3      2      1     \       /     /      / \      \      3     2     1      1   3      2     /     /       \                 \    2     1         2         ...
Read more

Longest prefix matching - trie

/*** Longest prefix matching Given a dictionary of words and an input string, find the longest prefix of the string which is also a word in dictionary. Example: Let the dictionary contains the following words: {are, area, base, cat, cater, children, basement} Below are some input/output examples: -------------------------------------- Input String            Output -------------------------------------- caterer                 cater basemexy                base child                   < Empty > ***/ #include <iostream> #include <string> using namespace std; struct node {        char val; ...
Read more