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

更换图片地址

parent 18798af8
Hide whitespace changes
Inline Side-by-side
notes/LeetCode第24号问题：两两交换链表中的节点.md
View file @ 5dee53d9
......@@ -36,7 +36,7 @@
### 动画描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20181103145019.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/6kpyu.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/k8lty.png)
\ No newline at end of file
notes/LeetCode第268号问题：缺失数字.md
View file @ 5dee53d9
......@@ -16,7 +16,7 @@
你的算法应该具有线性时间复杂度。 你可以不使用额外空间来实现吗？
![](https://raw.githubusercontent.com/MisterBooo/myBlogPic/master/20190516113448.png)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/i47fw.png)
## 题目解析
......@@ -32,7 +32,7 @@
将少了一个数的数组与 0 到 n 之间完整的那个数组进行异或处理，因为相同的数字异或会变为了 0 ，那么全部数字异或后，剩下的就是少了的那个数字。
![](https://raw.githubusercontent.com/MisterBooo/myBlogPic/master/20190516143539.png)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/el8zt.png)
#### 代码实现1
......@@ -75,7 +75,7 @@ class Solution {
- 遍历数组计算出原始数组中数字的累积和
- 两和相减，差值就是丢失的那个数字
![](https://raw.githubusercontent.com/MisterBooo/myBlogPic/master/20190516151203.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/fn1ys.gif)
```java
//小吴之前担心会数据溢出，不过估计这题考察的不是这个，所以测试用例没写这种吧，还是能 AC 的
......@@ -123,4 +123,4 @@ public 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/bfmeg.png)
\ No newline at end of file
notes/LeetCode第26号问题：删除排序数组中的重复项.md
View file @ 5dee53d9
......@@ -62,7 +62,7 @@ for (int i = 0; i < len; i++) {
### 动画描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20181116115601.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/4y1ec.gif)
......@@ -90,4 +90,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/j3v4r.png)
\ No newline at end of file
notes/LeetCode第279号问题：完全平方数.md
View file @ 5dee53d9
......@@ -73,7 +73,7 @@ public int numSquares(int n) {
### 动画描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20190502113958.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/pf34s.gif)
### 代码实现
......@@ -117,4 +117,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/dell9.png)
\ No newline at end of file
notes/LeetCode第283号问题：移动零.md
View file @ 5dee53d9
......@@ -32,7 +32,7 @@
动画如下：
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20181027160100.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/0eeix.gif)
代码如下：
......@@ -68,7 +68,7 @@ public:
动画如下：
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20181027160135.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/jodp0.gif)
代码如下：
......@@ -101,7 +101,7 @@ public:
动画如下：
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20181030085904.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/gcetr.gif)
代码如下：
```
......@@ -134,4 +134,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/o6der.png)
\ No newline at end of file
notes/LeetCode第295号问题：数据流的中位数.md
View file @ 5dee53d9
......@@ -49,7 +49,7 @@ findMedian() -> 2
### 动画描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20190502114925.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/slcao.gif)
### 代码实现
......@@ -91,4 +91,4 @@ class MedianFinder {
![](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/k2ihh.gif)
\ No newline at end of file
notes/LeetCode第2号问题：两数相加.md
View file @ 5dee53d9
......@@ -28,7 +28,7 @@
### 动画描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20181117122234.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/lchmg.gif)
### 代码实现
......
notes/LeetCode第301号问题：删除无效的括号.md
View file @ 5dee53d9
......@@ -160,4 +160,4 @@ public 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/syhz6.png)
\ No newline at end of file
notes/LeetCode第326号问题：3的幂.md
View file @ 5dee53d9
......@@ -55,4 +55,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/fzqbe.png)
\ No newline at end of file
notes/LeetCode第328号问题：奇偶链表.md
View file @ 5dee53d9
......@@ -41,7 +41,7 @@
### 动画描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20181104142817.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/xh0aj.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/ro88e.png)
\ No newline at end of file
notes/LeetCode第342号问题：4的幂.md
View file @ 5dee53d9
......@@ -77,13 +77,13 @@ class Solution {
将这个二进制数转换成 16 进制表示：0x55555555 。有没有感觉逼格更高点。。。
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20190509194742.png)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/c0s9n.png)
### 图片描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20190510090919.jpeg)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/ux5pa.jpg)
......
notes/LeetCode第344号问题：反转字符串.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/bksj7.png)
\ No newline at end of file
notes/LeetCode第347号问题：前K个高频元素.md
View file @ 5dee53d9
......@@ -37,7 +37,7 @@
以下十种排序算法，任你挑选！
![](https://raw.githubusercontent.com/MisterBooo/myBlogPic/master/20190624173156)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/qya5e.png)
可以发现，使用常规的诸如 冒泡、选择、甚至快速排序都是不满足题目要求，它们的时间复杂度都是大于或者等于 O(n log⁡n) ，而题目要求算法的时间复杂度必须优于 O(n log n) 。
......@@ -50,7 +50,7 @@
题目最终需要返回的是前 k 个频率最大的元素，可以想到借助堆这种数据结构，对于 k 频率之后的元素不用再去处理，进一步优化时间复杂度。
![](https://raw.githubusercontent.com/MisterBooo/myBlogPic/master/20190624213721.jpeg)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/nloow.jpg)
具体操作为：
......@@ -62,7 +62,7 @@
![堆中的元素就是前 k 个频率最大的元素](https://raw.githubusercontent.com/MisterBooo/myBlogPic/master/20190624231240.gif)
![堆中的元素就是前 k 个频率最大的元素](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/xged1.gif)
代码如下：
......@@ -115,7 +115,7 @@ class Solution {
首先依旧使用哈希表统计频率，统计完成后，创建一个数组，将频率作为数组下标，对于出现频率不同的数字集合，存入对应的数组下标即可。
![](https://raw.githubusercontent.com/MisterBooo/myBlogPic/master/20190625100134.jpeg)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/6tge2.jpg)
代码实现如下：
......
notes/LeetCode第349号问题：两个数组的交集.md
View file @ 5dee53d9
......@@ -39,7 +39,7 @@
### 动画描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20190502123122.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/xfx1k.gif)
### 代码实现
......@@ -72,4 +72,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/y7jcl.png)
\ No newline at end of file
notes/LeetCode第350号问题：两个数组的交集II.md
View file @ 5dee53d9
......@@ -44,7 +44,7 @@
### 动画描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20181027160512.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/3kc4w.gif)
### 代码实现
......@@ -77,8 +77,8 @@ public:
#### 执行结果
![img](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20181029083150.png)
![img](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/xdsii.png)
![](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/3zqhi.png)
\ No newline at end of file
notes/LeetCode第3号问题：无重复字符的最长子串.md
View file @ 5dee53d9
......@@ -31,7 +31,7 @@
### 动画描述
![动画描述](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/blog/o2acw.gif)
![动画描述](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/20ahe.gif)
### 代码实现
......
notes/LeetCode第445号问题：两数相加II.md
View file @ 5dee53d9
......@@ -66,4 +66,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/fdvu1.png)
\ No newline at end of file
notes/LeetCode第447号问题：回旋镖的数量.md
View file @ 5dee53d9
......@@ -50,7 +50,7 @@ n 最大为 500，可以使用时间复杂度为 O(n^2)的算法。
### 动画描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20181030112917.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/0ys9o.gif)
### 代码实现
......@@ -96,4 +96,4 @@ private:
![](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/s95kv.png)
\ No newline at end of file
notes/LeetCode第454号问题：四数相加II.md
View file @ 5dee53d9
......@@ -41,7 +41,7 @@ D = [ 0, 2]
### 动画描述
![](https://bucket-1257126549.cos.ap-guangzhou.myqcloud.com/20181029154232.gif)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/dgth9.gif)
### 代码实现
......@@ -82,4 +82,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/sx6gy.png)
\ No newline at end of file
notes/LeetCode第642号问题：设计一个搜索自动完成系统.md
View file @ 5dee53d9
......@@ -204,4 +204,4 @@ private:
![](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/gxmux.png)
\ 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