文/麥大人 01 “小時(shí)候，鄉(xiāng)愁是一枚小小的郵票，我在這頭，母親在那頭。長(zhǎng)大后，鄉(xiāng)愁是一張窄窄的船票，我在這頭，新娘在那頭…” 很多年前，讀到余光中先生的這首《鄉(xiāng)愁》，當(dāng)時(shí)只...
發(fā)簡(jiǎn)信
IP屬地：加州
-
兒時(shí)的年味 | 回不去的是故鄉(xiāng)，到不了的是遠(yuǎn)方
-
16. 3Sum Closest
Given an array nums of n integers and an integer target, find three integers in nums su...
-
18. 4Sum
Given an array nums of n integers and an integer target, are there elements a, b, c, an...
-
15. 3Sum
Given an array nums of n integers, are there elements a, b, c in nums such that a + b +...
-
3. Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. ...
-
106. Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree. Note:You ma...
-
105. Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may...
-
112. Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that ...
-
108. Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height bal...
-
174. Dungeon Game
The demons had captured the princess (P) and imprisoned her in the bottom-right corner ...
-
213. House Robber II
After robbing those houses on that street, the thief has found himself a new place for ...
-
198. House Robber
You are a professional robber planning to rob houses along a street. Each house has a c...
-
70. Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top. Each time you can ...
-
64. Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from top left to botto...
-
121. 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....
-
53. Maximum Subarray
開(kāi)始動(dòng)態(tài)規(guī)劃啦！Given an integer array nums, find the contiguous subarray (containing at least ...
-
63. Unique Paths II
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagra...
-
206. Reverse Linked List
Reverse a singly linked list. 畫(huà)圖即可，創(chuàng)建兩個(gè)指針，一個(gè)pivot指向頭節(jié)點(diǎn)，可用于判斷是否反轉(zhuǎn)到最后一個(gè)，用pivot.next == nu...