文/麥大人 01 “小時(shí)候,鄉(xiāng)愁是一枚小小的郵票巷燥,我在這頭赡盘,母親在那頭。長(zhǎng)大后缰揪,鄉(xiāng)愁是一張窄窄的船票陨享,我在這頭,新娘在那頭…” 很多年前钝腺,讀到余光中先生的這首《鄉(xiāng)愁》抛姑,當(dāng)時(shí)只...
![240](https://cdn2.jianshu.io/assets/default_avatar/15-a7ac401939dd4df837e3bbf82abaa2a8.jpg?imageMogr2/auto-orient/strip|imageView2/1/w/240/h/240)
文/麥大人 01 “小時(shí)候,鄉(xiāng)愁是一枚小小的郵票巷燥,我在這頭赡盘,母親在那頭。長(zhǎng)大后缰揪,鄉(xiāng)愁是一張窄窄的船票陨享,我在這頭,新娘在那頭…” 很多年前钝腺,讀到余光中先生的這首《鄉(xiāng)愁》抛姑,當(dāng)時(shí)只...
Given an array nums of n integers and an integer target, find three integers in nums su...
Given an array nums of n integers and an integer target, are there elements a, b, c, an...
Given an array nums of n integers, are there elements a, b, c in nums such that a + b +...
Given a string, find the length of the longest substring without repeating characters. ...
Given inorder and postorder traversal of a tree, construct the binary tree. Note:You ma...
Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may...
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that ...
Given an array where elements are sorted in ascending order, convert it to a height bal...
The demons had captured the princess (P) and imprisoned her in the bottom-right corner ...
After robbing those houses on that street, the thief has found himself a new place for ...
You are a professional robber planning to rob houses along a street. Each house has a c...
You are climbing a stair case. It takes n steps to reach to the top. Each time you can ...
Given a m x n grid filled with non-negative numbers, find a path from top left to botto...
Say you have an array for which the ith element is the price of a given stock on day i....
開(kāi)始動(dòng)態(tài)規(guī)劃啦!Given an integer array nums, find the contiguous subarray (containing at least ...
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagra...
Reverse a singly linked list. 畫(huà)圖即可拍屑,創(chuàng)建兩個(gè)指針途戒,一個(gè)pivot指向頭節(jié)點(diǎn)坑傅,可用于判斷是否反轉(zhuǎn)到最后一個(gè)僵驰,用pivot.next == nu...