摘要:
Implement a trie with insert, search, and startsWith methods. Note:You may assume that all inputs are consist of lowercase letters a-z. 解法: Trie(字典树)的 阅读全文
摘要:
Given an integer matrix, find the length of the longest increasing path. From each cell, you can either move to four directions: left, right, up or do 阅读全文
摘要:
Given a singly linked list, return a random node's value from the linked list. Each node must have the same probability of being chosen. Follow up: Wh 阅读全文