2014年09月_sduzh9011

10月 09月 08月 07月 04月 03月 02月 01月

转载 Trie树：应用于统计和排序

1. 什么是trie树 1.Trie树（特例结构树） Trie树，又称单词查找树、字典树，是一种树形结构，是一种哈希树的变种，是一种用于快速检索的多叉树结构。典型应用是用于统计和排序大量的字符串（但不仅限于字符串），所以经常被搜索引擎系统用于文本词频统计。它的优点是：最大限度地减少无谓的字符串比较，查询效率比哈希表高。 Trie的核心思想是空间换时间。利用

2014-09-26 22:49:15 623

转载从set/map谈到hashtable/hash_map/hash_set

1、从set/map谈到hashtable/hash_map/hash_set 稍后本文第二部分中将多次提到hash_map/hash_set，下面稍稍介绍下这些容器，以作为基础准备。一般来说，STL容器分两种：序列式容器(vector/list/deque/stack/queue/heap)，关联式容器。关联式容器又分为set(集合)和map(映射表)两大

2014-09-25 20:18:20 615

转载 Installing C++11 on Ubuntu 12.04 LTS

原文地址：http://clark.ws/2013/08/26/installing-c11-on-ubuntu-12-04-lts/ Installing C++11 on Ubuntu 12.04 LTS August 26, 2013 by Colin Clark · 1 Comment I used to code in C. In fact, I wrote a lo

2014-09-25 10:44:19 817

原创【LeetCode】Binary Tree Level Order Traversal II

题目： Binary Tree Level Order Traversal II Total Accepted: 18664 Total Submissions: 59503 Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from le

2014-09-23 21:26:19 504

原创【LeetCode】Best Time to Buy and Sell Stock III

https://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/ 这题

2014-09-23 18:57:27 499

原创【LeetCode】Best Time to Buy and Sell Stock II

https://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/ 每笔赚钱交易都做：

2014-09-23 18:51:29 467

原创【LeetCode】Best Time to Buy and Sell Stock

Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),

2014-09-23 18:48:54 492

原创【LeetCode】Word Break

Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. For example, given s = "leetcode", dict = ["leet",

2014-09-23 18:41:50 483