原创 【Leetcode長征系列】Length of Last Word

原題: Given a string s consists of upper/lower-case alphabets and empty space characters' ', return the length of last w

原创 【Leetcode長征系列】Validate Binary Search Tree

原題: Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The

原创 【Leetcode長征系列】Symmetric Tree

原題: Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this b

原创 【Leetcode長征系列】Longest Consecutive Sequence

原題: Given an unsorted array of integers, find the length of the longest consecutive elements sequence. For example, Gi

原创 【Leetcode長征系列】Palindrome Number

原型: Determine whether an integer is a palindrome. Do this without extra space. Some hints: Could negative integers be

原创 ubuntu 14.04 下安裝sublime text 2

刷了這麼久的Leetcode,現在題越來越難,經常不容易一次性AC,所以就琢磨着安裝一個IDE。然後就想到了sublime $ sudo add-apt-repository ppa:webupd8team/sublime-text-2

原创 Dremel: Interactive Analysis of Web-Scale Datasets 1~6節算法思想部分翻譯

摘要: Dremel是一個具有可擴展性和交互性,專用於分析只讀嵌套數據的查詢系統。它本身對多級操作數和柱狀數據佈局的融合使它得以在秒級的反應時間內對有萬億數量級行記錄的表進行集成語句查詢。這個系統在谷歌包含數以千計的CPU和PT級的數據量

原创 【Leetcode長征系列】Path Sum II

原題: Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example

原创 【Leetcode長征系列】Minimum Depth of Binary Tree

原題: Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from

原创 【Leetcode長征系列】Sum Root to Leaf Numbers

原題: Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example i

原创 【Leetcode長征系列】Flatten Binary Tree to Linked List

原題: Given a binary tree, flatten it to a linked list in-place. For example, Given 1 / \ 2 5

原创 【Leetcode長征系列】Valid Sudoku

原題: Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules. The Sudoku board could be partially fil

原创 【讀書筆記】Mining of massive datasets

For clustering computing, the file system must also be different from those legacy system, a brand new system which we

原创 【Leetcode長征系列】Unique Paths II

原題: Follow up for "Unique Paths": Now consider if some obstacles are added

原创 【Leetcode長征系列】Valid Palindrome

原題: Given a string, determine if it is a palindrome, considering only characters and ignoring cases. For example,"A ma