Skip to content
GitLab
Commit 5dee53d9 authored by 程序员吴师兄's avatar 程序员吴师兄
Browse files

更换图片地址

parent 18798af8
Hide whitespace changes
Inline Side-by-side
notes/LeetCode第15号问题：三数之和.md
View file @ 5dee53d9
......@@ -55,4 +55,4 @@ public:
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/fz0rq.png)
\ No newline at end of file
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/m1phx.gif)
\ No newline at end of file
notes/LeetCode第167号问题：两数之和II-输入有序数组.md
View file @ 5dee53d9
......@@ -37,7 +37,7 @@
### 动画描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20190502110607.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/59rnm.gif)
### 代码实现
......@@ -68,4 +68,4 @@ public:
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/fz0rq.png)
\ No newline at end of file
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/9lro6.png)
\ No newline at end of file
notes/LeetCode第169号问题：求众数.md
View file @ 5dee53d9
......@@ -79,7 +79,7 @@ class Solution {
### 动画描述
![](https://raw.githubusercontent.com/MisterBooo/myBlogPic/master/20190626115001.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/bbjtv.gif)
### 代码实现
......@@ -129,7 +129,7 @@ class Solution {
### 动画描述
![](https://raw.githubusercontent.com/MisterBooo/myBlogPic/master/20190626150830.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/8wyb2.gif)
### 代码实现
......
notes/LeetCode第172号问题：阶乘后的零.md
View file @ 5dee53d9
......@@ -68,7 +68,7 @@ public class Solution {
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/fz0rq.png)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/tvt94.png)
......
notes/LeetCode第187号问题：重复的DNA序列.md
View file @ 5dee53d9
......@@ -65,4 +65,4 @@ public:
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/fz0rq.png)
\ No newline at end of file
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/xzbvx.png)
\ No newline at end of file
notes/LeetCode第191号问题：位1的个数.md
View file @ 5dee53d9
......@@ -88,4 +88,4 @@ public:
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/fz0rq.png)
\ No newline at end of file
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/se6v6.png)
\ No newline at end of file
notes/LeetCode第199号问题：二叉树的右视图.md
View file @ 5dee53d9
......@@ -36,7 +36,7 @@
### 动画描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20181115113908.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/i2nzo.gif)
### 代码实现
......@@ -67,4 +67,4 @@ public:
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/fz0rq.png)
\ No newline at end of file
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/afv89.gif)
\ No newline at end of file
notes/LeetCode第19号问题：删除链表的倒数第N个节点.md
View file @ 5dee53d9
......@@ -40,7 +40,7 @@
### 动画描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20181106162853.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/r04hv.gif)
### 代码实现
......@@ -75,4 +75,4 @@ public:
};
```
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/fz0rq.png)
\ No newline at end of file
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/xbyq0.gif)
\ No newline at end of file
notes/LeetCode第1号问题：两数之和.md
View file @ 5dee53d9
......@@ -35,7 +35,7 @@
### 动画描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20181028221055.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/mol6g.gif)
### 代码实现
......@@ -65,4 +65,4 @@ public:
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/fz0rq.png)
\ No newline at end of file
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/wavdg.png)
\ No newline at end of file
notes/LeetCode第201号问题：数字范围按位与.md
View file @ 5dee53d9
......@@ -59,4 +59,4 @@ public:
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/fz0rq.png)
\ No newline at end of file
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/bjgx9.png)
\ No newline at end of file
notes/LeetCode第203号问题：移除链表元素.md
View file @ 5dee53d9
......@@ -25,7 +25,7 @@
### 动画描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20181102163006.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/tuy84.gif)
### 代码实现
......@@ -86,4 +86,4 @@ public:
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/fz0rq.png)
\ No newline at end of file
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/sbo5i.png)
\ No newline at end of file
notes/LeetCode第206号问题：反转链表.md
View file @ 5dee53d9
......@@ -31,7 +31,7 @@
### 动画描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20181101175158.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/voxlq.gif)
### 代码实现
......@@ -57,4 +57,4 @@ public:
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/fz0rq.png)
\ No newline at end of file
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/2z3t0.png)
\ No newline at end of file
notes/LeetCode第209号问题：长度最小的子数组.md
View file @ 5dee53d9
......@@ -37,25 +37,25 @@
### 动画描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20181027160331.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/0ga4f.gif)
设置滑动窗口的长度为 0 ，位于数轴的最左端。
##### 1 .滑动窗口右端 R 开始移动，直到区间满足给定的条件，也就是和大于 7 ，此时停止于第三个元素 2，当前的最优长度为 4
![图 1](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/8rr0w.jpg)
![图 1](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/lo41y.jpg)
##### 2. 滑动窗口左端 L 开始移动，缩小滑动窗口的大小，停止于第一个元素 3，此时区间和为 6，使得区间和不满足给定的条件（此时不大于 7）
![图片 2](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/77oa4.jpg)
![图片 2](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/j7qnc.jpg)
#### 3. 滑动窗口右端 R 继续移动，停止于第四个元素 4，此时和位 10 ，但最优长度仍然为 4
![图片 3](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/8ksiz.jpg)
![图片 3](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/q8dxy.jpg)
......@@ -95,4 +95,4 @@ class Solution {
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/fz0rq.png)
\ No newline at end of file
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/0fotr.png)
\ No newline at end of file
notes/LeetCode第20号问题：有效的括号.md
View file @ 5dee53d9
......@@ -67,7 +67,7 @@
### 动画描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20181108111124.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/xu55u.gif)
### 代码实现
......@@ -112,4 +112,4 @@ public:
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/fz0rq.png)
\ No newline at end of file
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/gkcza.png)
\ No newline at end of file
notes/LeetCode第219号问题：存在重复元素II.md
View file @ 5dee53d9
......@@ -43,7 +43,7 @@
### 动画描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20181031104805.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/gjz5m.gif)
### 代码实现
......@@ -84,4 +84,4 @@ public:
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/fz0rq.png)
\ No newline at end of file
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/msz27.png)
\ No newline at end of file
notes/LeetCode第21号问题：合并两个有序链表.md
View file @ 5dee53d9
......@@ -104,4 +104,4 @@ ListNode* mergeTwoOrderedLists(ListNode* pHead1, ListNode* pHead2){
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/fz0rq.png)
\ No newline at end of file
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/1ubug.png)
\ No newline at end of file
notes/LeetCode第231号问题：2的幂.md
View file @ 5dee53d9
......@@ -37,7 +37,7 @@
首先，先来分析一下 2 的次方数的二进制写法：
![表格](https://user-gold-cdn.xitu.io/2019/2/21/1690d8f7ad5bc000?w=1630&h=190&f=jpeg&s=18479)
![表格](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/3wdpd.jpg)
仔细观察，可以看出 2 的次方数都只有一个 1 ，剩下的都是 0 。根据这个特点，只需要每次判断最低位是否为 1 ，然后向右移位，最后统计 1 的个数即可判断是否是 2 的次方数。
......@@ -63,7 +63,7 @@ public:
### 图片描述
![](https://user-gold-cdn.xitu.io/2019/2/21/1690d8f7ad92ad5e?w=356&h=466&f=jpeg&s=15576)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/1w9lq.jpg)
### 代码实现
......@@ -80,4 +80,4 @@ public:
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/fz0rq.png)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/guem9.png)
notes/LeetCode第237号问题：删除链表中的节点.md
View file @ 5dee53d9
......@@ -12,7 +12,7 @@
现有一个链表 -- head = [4,5,1,9]，它可以表示为:
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20190502113234.png)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/uv8bw.png)
......@@ -49,7 +49,7 @@
### 动画描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20181105171450.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/1navy.gif)
### 代码实现
......@@ -76,4 +76,4 @@ public:
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/fz0rq.png)
\ No newline at end of file
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/f5g8p.png)
\ No newline at end of file
notes/LeetCode第239号问题：滑动窗口最大值.md
View file @ 5dee53d9
......@@ -53,7 +53,7 @@ Deque 继承自 Queue（队列），它的直接实现有 ArrayDeque、LinkedLis
### 动画描述
![动画描述 Made by Jun Chen](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/20whr.gif)
![动画描述 Made by Jun Chen](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/8ggd3.gif)
### 代码实现
......@@ -89,4 +89,4 @@ class Solution {
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/fz0rq.png)
\ No newline at end of file
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/jwm9y.gif)
\ No newline at end of file
notes/LeetCode第23号问题：合并K个排序链表.md
View file @ 5dee53d9
......@@ -24,11 +24,11 @@
**输入**
![图一](https://user-gold-cdn.xitu.io/2019/4/9/169ff8cbaf694440?w=2360&h=614&f=jpeg&s=63179)
![图一](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/u2jnp.jpg)
**输出**
![图二](https://user-gold-cdn.xitu.io/2019/4/9/169ff8cbb372e71f?w=2518&h=572&f=jpeg&s=62543)
![图二](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/yc4ac.jpg)
### 题目解析
......@@ -44,7 +44,7 @@
### 动画演示
![动画演示](https://user-gold-cdn.xitu.io/2019/4/9/169ff8cbb36cb6f7?w=939&h=507&f=gif&s=6542126)
![动画演示](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/iuxmh.gif)
### 代码实现
......@@ -136,7 +136,7 @@ class Solution {
这里可以参考 **归并排序 **的分治思想，将这 K 个链表先划分为两个 K/2 个链表，处理它们的合并，然后不停的往下划分，直到划分成只有一个或两个链表的任务，开始合并。
![归并-分治](https://user-gold-cdn.xitu.io/2019/4/9/169ff8cbb2c891fe?w=953&h=531&f=gif&s=164652)
![归并-分治](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/74ush.gif)
### 代码实现
......@@ -186,4 +186,4 @@ class Solution {
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/fz0rq.png)
\ No newline at end of file
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/jhykq.gif)
\ No newline at end of file
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment