杨领well
杨领well
全部文章
分类
C++(3)
Effective C++ 笔记(4)
LeetCode(151)
LeetCode Weekly Contest 92(1)
LeetCode Weekly Contest 93(2)
linux(2)
TCP/IP 协议(3)
windows(1)
未归档(33)
杨领well 的 TCP/IP 协议专栏(7)
杨领well的 LeetCode 题解专栏(59)
源码(1)
题解(1)
归档
标签
去牛客网
登录
/
注册
杨领well的博客
君子食无求饱,居无求安,敏于事而慎于言,就有道而正焉。
全部文章
(共268篇)
LeetCode: 123. Best Time to Buy and Sell Stock III
LeetCode: 123. Best Time to Buy and Sell Stock III 题目大意 Say you have an array for which the ith element is the price of a given stock on day i. Des...
2018-04-06
0
580
KMP 算法(Knuth–Morris–Pratt algorithm)的基本思想
KMP 算法(Knuth–Morris–Pratt algorithm)的基本思想 阅读本文之前,您最好能够了解 KMP 算法解决的是什么问题,最好能用暴力方式(Brute Force)解决一下该问题。 KMP 算法主要想解决的是文本搜索的问题: 给定一个模式字符串 p 和一个子串 t, ...
2018-04-05
0
479
LeetCode: 122. Best Time to Buy and Sell Stock II
LeetCode: 122. Best Time to Buy and Sell Stock II 题目描述 Say you have an array for which the ith element is the price of a given stock on day i. Desi...
2018-04-05
0
593
LeetCode: 121. Best Time to Buy and Sell Stock
LeetCode: 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. If you ...
2018-04-05
0
375
LeetCode: 120. Triangle
LeetCode: 120. Triangle 题目描述 Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row b...
2018-04-04
0
360
LeetCode: 119. Pascal's Triangle II
LeetCode: 119. Pascal’s Triangle II 题目描述 Given an index k, return the kth row of the Pascal’s triangle. For example, given k = 3, Return [1,3,3,1]...
2018-04-03
0
389
LeetCode: 118. Pascal's Triangle
LeetCode: 118. Pascal’s Triangle 题目描述 Given numRows, generate the first numRows of Pascal’s triangle. For example, given numRows = 5, Return [ ...
2018-04-03
0
410
LeetCode: 117. Populating Next Right Pointers in Each Node II
LeetCode: 117. Populating Next Right Pointers in Each Node II 题目描述 Follow up for problem “Populating Next Right Pointers in Each Node”. What if the...
2018-04-02
0
325
LeetCode: 116. Populating Next Right Pointers in Each Node
LeetCode: 116. Populating Next Right Pointers in Each Node 题目描述 Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeL...
2018-04-01
0
424
LeetCode: 115. Distinct Subsequences
LeetCode: 115. Distinct Subsequences 题目描述 Given a string S and a string T, count the number of distinct subsequences of S which equals T. A subsequ...
2018-03-31
0
411
首页
上一页
14
15
16
17
18
19
20
21
22
23
下一页
末页