摘要：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 阅读全文

摘要：i & -i = i 最低位的 1 所表示的值 i 单数: i & -i = 1 i 双数: i = 2^k1 +...+ 2^kn (k1 <...<kn) i & -i = 2^k1(负数二进制表达 = 其绝对值的二进制表达 + 1) 阅读全文

摘要：A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose you are give 阅读全文

摘要：Reference : https://leetcode.com/discuss/72701/here-10-line-template-that-can-solve-most-substring-problems 3. Longest Substring Without Repeating Cha 阅读全文