Trie Tree

     摘要: #Trie Tree的基本特點(diǎn)
1）根節(jié)點(diǎn)不包含字符，除根節(jié)點(diǎn)外每個(gè)節(jié)點(diǎn)只包含一個(gè)字符
2）從根節(jié)點(diǎn)到某一個(gè)節(jié)點(diǎn)，路徑上經(jīng)過的字符連接起來，為該節(jié)點(diǎn)對(duì)應(yīng)的字符串

3）每個(gè)節(jié)點(diǎn)的所有子節(jié)點(diǎn)包含的字符串不相同
  閱讀全文

posted @ 2011-06-14 16:57 XXXXXX 閱讀(1083) | 評(píng)論 (0)  編輯

Bloom Filter

     摘要: The Bloom filter, conceived by Burton Howard Bloom in 1970, is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set.False positivesare possible, but false negatives are not. Elements can be added to the set, but not removed (though this can be addressed with a counting filter). The more elements that are added to the set, the larger the probability of false positives
  閱讀全文

posted @ 2011-06-12 23:58 XXXXXX 閱讀(299) | 評(píng)論 (0)  編輯

【編程珠現(xiàn)】-算法設(shè)計(jì)技術(shù)

posted @ 2011-01-14 11:20 XXXXXX 閱讀(274) | 評(píng)論 (0)  編輯

【編程珠璣】-啊哈！算法

posted @ 2011-01-11 11:49 XXXXXX 閱讀(369) | 評(píng)論 (0)  編輯

【編程珠璣】-開篇

posted @ 2011-01-08 10:41 XXXXXX 閱讀(231) | 評(píng)論 (0)  編輯

K-Menas算法

posted @ 2011-01-04 11:05 XXXXXX 閱讀(479) | 評(píng)論 (0)  編輯

打印全排列

posted @ 2010-11-21 00:27 XXXXXX 閱讀(508) | 評(píng)論 (0)  編輯