Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
爱吃血肠
leetcode
提交
badd4e0e
L
leetcode
项目概览
爱吃血肠
/
leetcode
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
L
leetcode
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
前往新版Gitcode,体验更适合开发者的 AI 搜索 >>
提交
badd4e0e
编写于
4月 28, 2019
作者:
L
luzhipeng
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
feat: #334
上级
aac59ff7
变更
6
隐藏空白更改
内联
并排
Showing
6 changed file
with
110 addition
and
1 deletion
+110
-1
README.md
README.md
+1
-0
assets/drawio/152.maximum-product-subarray .drawio
assets/drawio/152.maximum-product-subarray .drawio
+1
-0
assets/drawio/334.increasing-triplet-subsequence.drawio
assets/drawio/334.increasing-triplet-subsequence.drawio
+1
-0
assets/problems/334.increasing-triplet-subsequence.png
assets/problems/334.increasing-triplet-subsequence.png
+0
-0
problems/152.maximum-product-subarray.md
problems/152.maximum-product-subarray.md
+1
-1
problems/334.increasing-triplet-subsequence.md
problems/334.increasing-triplet-subsequence.md
+106
-0
未找到文件。
README.md
浏览文件 @
badd4e0e
...
...
@@ -123,6 +123,7 @@ leetcode 题解,记录自己的 leetcode 解题之路。
-
[
240.search-a-2-d-matrix-ii
](
./problems/240.search-a-2-d-matrix-ii.md
)
-
🖊
[
279.perfect-squares
](
./problems/279.perfect-squares.md
)
-
[
322.coin-change
](
./problems/322.coin-change.md
)
-
🆕
[
334.increasing-triplet-subsequence
](
./problems/334.increasing-triplet-subsequence.md
)
-
[
328.odd-even-linked-list
](
./problems/328.odd-even-linked-list.md
)
-
[
416.partition-equal-subset-sum
](
./problems/416.partition-equal-subset-sum.md
)
-
[
445.add-two-numbers-ii
](
./problems/445.add-two-numbers-ii.md
)
...
...
assets/drawio/152.maximum-product-subarray .drawio
0 → 100644
浏览文件 @
badd4e0e
<mxfile modified="2019-04-28T04:04:43.390Z" host="www.draw.io" agent="Mozilla/5.0 (Macintosh; Intel Mac OS X 10_12_6) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/73.0.3683.86 Safari/537.36" etag="x7taIV4aV3HK_th4ormZ" version="10.6.5" type="device"><diagram id="YXMyPOv_ULgBjCf9Ohy7" name="第 1 页">7Znfb5swEMf/mjy2wja/8rik6TYpk6Z20qS+TA5cgjXAyDgN3V8/EwyBOG02iQRU9SlwPoz53Nd3R5iQeVJ8FjSLvvEQ4gm2wmJC7iYYIzL11U9peaksnosqw0awUDsdDI/sD2ijpa1bFkLecZScx5JlXWPA0xQC2bFRIfiu67bmcfeuGd2AYXgMaGxaf7JQRpXVx97B/gXYJqrvjNxpNZLQ2lk/SR7RkO9aJrKYkLngXFZHSTGHuIRXc6muu39ltFmYgFT+ywV2ePf08LB6Xn79sbSe7ueLmYxusF1N80zjrX5ivVr5UiMQfJuGUM6CJmS2i5iEx4wG5ehOBV3ZIpnEejiXgv+GOY+52F9NVr5jO5YaWbM4btnXfgBBoOx6ASAkFK8+GmqAKaUBT0CKF+WiLyBEM9Yiw65W3e4QMle7RK1oOY4WihbJppn5wFEdaJT/g5W8B6zNJtRY0dQbFisyqL6F1TqPtQdIyDmCVJ+fgWRbl9KeAYkMDslQ0tCQzP15M7yUsDcySmZxsAeHdJzrB4fknk/1GWepBLF4Vs+Y1xm9bgdKbCHNo4bhq2k/5amacBbTFcTfec4k46kyB1BOrgZKrky1LssjhxWXkicth08x25QDkpfxofqsmUctLStXnhSbsqm7TfKAwm0ImYCASghvM54rz1/7/sosQZY1m9/jnrbEUbSnZrDxqQp0qWBPjWAntFCG/bHlGpFXU6pOFc7vDJpnVfu6ZkWphGOoIQV/HZzqBNzAh9W6rzztdHBjy+TtXJN3XTfawFnaADe3Wn/AHfBD+xRwH6+I614IuDc0cDPntxXeJ/Am6aGh5I6cscnduZrc36R/Fe0b9AfXfq+lHJ15g2vK5Kjrue45+kh103GVcuR9RPty0SbOyKLtv1nXTrz99ZRa+9g53tjK1Ik2uFWmbtCwfdnF+Q9dqPCJrrglZvMlfTxaJmRkWsbmn4odLdv+u9KywX9wLeOPMny5Moy8a5VhdXr4lrUfa30RJIu/</diagram></mxfile>
\ No newline at end of file
assets/drawio/334.increasing-triplet-subsequence.drawio
0 → 100644
浏览文件 @
badd4e0e
<mxfile modified="2019-04-28T05:44:04.589Z" host="www.draw.io" agent="Mozilla/5.0 (Macintosh; Intel Mac OS X 10_12_6) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/73.0.3683.86 Safari/537.36" etag="PODMzlxkKwJ-VLBAo4pq" version="10.6.5" type="device"><diagram id="a3jdPwh5aMc9FGEKUp8T" name="第 1 页">1Zphb6MgGMc/jS/XWFBrX7aubrlsyXK75JJ7szCllSuKh2zt7tMfWGyrdNkuc8UtS9QHBP3x8PB/qA6M8u0VR2V2y1JMHeCmWwdeOgCM4TSUB2V52VkmwXhnWHGS6koHwz35i7XR1dYnkuKqVVEwRgUp28aEFQVORMuGOGebdrUlo+1eS7TChuE+QdS0/iSpyHbWEEwO9mtMVlnT8ziY7kpy1FTWb1JlKGWbIxNcODDijIndWb6NMFXwGi67++JXSvcPxnEh3nPD5u76z292fQPEt5/w3otcEP260K08I/rUfuFKvDQIOHsqUqxacR0432RE4PsSJap0Iwdd2jKRU3k1lqe6PcwF3r76oOP960u/wSzHgr/IKnun0cS0y0z15ebA39em7Ah9Y0N6xFf7hg9Q5Inm8h+MgMEI2GcUDosRNBhB64zAwPzIMxh59hkNzI98g5FvnREcmB8FA2TUjdnexDKkyQAnWzdoW4cUfoGobR3S1IBkf/nvhm3rkBq5Pigh2Q3c9imZcttZBM40cuR4Lnxn7jphbGCTDctsB7+NDFXlLgVakq3C3AfDIGgzHAcmQ3iCIfw0hqYcdxYTZxap/4XnzGdOGA0Vpu+3YALXN2B6J2B6nwbT1O1tmKETTgcLs+2ZwDdhnnd2mwLffgwM3M789W3HQFPi219Pu5ROTczzUjJFvn1pZlA6sRacl5Kp8g1IVYZKdUryeqfvGImCQRJEZ5SsCmkTrDyy3qBHTO9YRQRhqvSRCcFyWYGqgjlK1qt6ACJGGa/7gsv6T1apO5s1Qc89FQH181xmQqitzJkiAeIkLeCIJKxYEjm0fJTIHkGcIoHkQdkreVxSJC5Qop6ruqiNSqTGvloa4x8kWT/cIr6WK2U4KotVDwPvTUBHBIyNgZe9mSO/N/Y/9GbuMngpNenIUetSykxtvo6UCtpSyrctpYCZAX0dKdUR+b5tKQXMwP7BPa4UVVldt6e10GukczOZbesqYAbED+549Y4sGBoyM/59UGT1jcwfmpdBM8p9UL33jmxoXgaH+BtrMDjHAuby2YVUMlIIzBfP8iUrzWL/q7p77EtuG1glOFvjRqgXrMCNjD/S9wlWjb8nATidNyB9tW+nyTzy7Up9GzHKqwThUYpLjhMkcDoqWSVrPtSfKcj6S0LpUTLhuvMoBuqtiLxBP0PBuBqeXsIxDNsu4JousJ/dZ5FQ8MRu1JdP58ZvpnOXMlm7oqiqHr7jDeNr2R6IZea0rbOnWCd6Ku8jFCeUVbhO686wQE9NGdhbmicvD9++1GVHXxDBxT8=</diagram></mxfile>
\ No newline at end of file
assets/problems/334.increasing-triplet-subsequence.png
0 → 100644
浏览文件 @
badd4e0e
66.3 KB
problems/152.maximum-product-subarray.md
浏览文件 @
badd4e0e
...
...
@@ -51,7 +51,7 @@ var maxProduct = function(nums) {
![
152.maximum-product-subarray
](
../assets/problems/152.maximum-product-subarray.png
)
这种思路的解法由于只需要遍历
依
次,其时间复杂度是O(n),代码见下方代码区。
这种思路的解法由于只需要遍历
一
次,其时间复杂度是O(n),代码见下方代码区。
## 关键点
-
同时记录乘积最大值和乘积最小值
...
...
334.increasing-triplet-subsequence.js
→
problems/334.increasing-triplet-subsequence.md
浏览文件 @
badd4e0e
## 题目地址
https://leetcode.com/problems/increasing-triplet-subsequence/description/
## 题目描述
```
Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.
Formally the function should:
Return true if there exists i, j, k
such that arr[i] < arr[j] < arr[k] given 0 ≤ i < j < k ≤ n-1 else return false.
Note: Your algorithm should run in O(n) time complexity and O(1) space complexity.
Example 1:
Input: [1,2,3,4,5]
Output: true
Example 2:
Input: [5,4,3,2,1]
Output: false
```
## 思路
这道题是求解顺序数字是否有三个递增的排列, 注意这里没有要求连续的,因此诸如滑动窗口的思路是不可以的。
题目要求O(n)的时间复杂度和O(1)的空间复杂度,因此暴力的做法就不用考虑了。
我们的目标就是
`依次`
找到三个数字,其顺序是递增的。因此我们的做法可以是依次遍历,
然后维护三个变量,分别记录最小值,第二小值,第三小值。只要我们能够填满这三个变量就返回true,否则返回false。
![
334.increasing-triplet-subsequence
](
../assets/problems/334.increasing-triplet-subsequence.png
)
## 关键点解析
-
维护三个变量,分别记录最小值,第二小值,第三小值。只要我们能够填满这三个变量就返回true,否则返回false
## 代码
```
js
/*
* @lc app=leetcode id=334 lang=javascript
*
...
...
@@ -62,4 +103,4 @@ var increasingTriplet = function(nums) {
return
false
;
};
```
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录