摘要：
参考这个帖子： http://blchen.com/fix-usb-drive-only-has-200m-free-space/ 阅读全文
摘要：
之前想在sublime里支持中文，参考了一些帖子，如： https://my.oschina.net/tsl0922/blog/113495 https://ming-yi.github.io/2016/09/07/%E8%A7%A3%E5%86%B3-Linux-%E4%B8%8B-Sublime 阅读全文
摘要：
Given a 2D board and a list of words from the dictionary, find all words in the board. Each word must be constructed from letters of sequentially adja 阅读全文
摘要：
Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjac 阅读全文
摘要：
Design a data structure that supports the following two operations: search(word) can search a literal word or a regular expression string containing o 阅读全文
摘要：
Implement a trie with insert, search, and startsWith methods. Note:You may assume that all inputs are consist of lowercase letters a-z. Implement a tr 阅读全文
摘要：
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of LCA on Wikipedia: “The lowes 阅读全文
摘要：
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example:Given binary tree [3 阅读全文
摘要：
Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate each next pointer to point to its ne 阅读全文
摘要：
Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tree could be any binary tree? Would your previous solution sti 阅读全文