Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commitbadd4e0

Browse files
author
luzhipeng
committed
1 parentaac59ff commitbadd4e0

7 files changed

+110
-66
lines changed

‎334.increasing-triplet-subsequence.js

Lines changed: 0 additions & 65 deletions
This file was deleted.

‎README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -123,6 +123,7 @@ leetcode 题解，记录自己的 leetcode 解题之路。
123123
-[240.search-a-2-d-matrix-ii](./problems/240.search-a-2-d-matrix-ii.md)
124124
- 🖊[279.perfect-squares](./problems/279.perfect-squares.md)
125125
-[322.coin-change](./problems/322.coin-change.md)
126+
- 🆕[334.increasing-triplet-subsequence](./problems/334.increasing-triplet-subsequence.md)
126127
-[328.odd-even-linked-list](./problems/328.odd-even-linked-list.md)
127128
-[416.partition-equal-subset-sum](./problems/416.partition-equal-subset-sum.md)
128129
-[445.add-two-numbers-ii](./problems/445.add-two-numbers-ii.md)
Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1 @@
1+
<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>
Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1 @@
1+
<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>
Loading

‎problems/152.maximum-product-subarray.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -51,7 +51,7 @@ var maxProduct = function(nums) {
5151

5252
![152.maximum-product-subarray](../assets/problems/152.maximum-product-subarray.png)
5353

54-
这种思路的解法由于只需要遍历依次，其时间复杂度是O(n)，代码见下方代码区。
54+
这种思路的解法由于只需要遍历一次，其时间复杂度是O(n)，代码见下方代码区。
5555
##关键点
5656

5757
- 同时记录乘积最大值和乘积最小值
Lines changed: 106 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,106 @@
1+
2+
##题目地址
3+
https://leetcode.com/problems/increasing-triplet-subsequence/description/
4+
5+
##题目描述
6+
7+
```
8+
Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.
9+
10+
Formally the function should:
11+
12+
Return true if there exists i, j, k
13+
such that arr[i] < arr[j] < arr[k] given 0 ≤ i < j < k ≤ n-1 else return false.
14+
Note: Your algorithm should run in O(n) time complexity and O(1) space complexity.
15+
16+
Example 1:
17+
18+
Input: [1,2,3,4,5]
19+
Output: true
20+
Example 2:
21+
22+
Input: [5,4,3,2,1]
23+
Output: false
24+
```
25+
26+
##思路
27+
这道题是求解顺序数字是否有三个递增的排列， 注意这里没有要求连续的，因此诸如滑动窗口的思路是不可以的。
28+
题目要求O(n)的时间复杂度和O(1)的空间复杂度，因此暴力的做法就不用考虑了。
29+
30+
我们的目标就是`依次`找到三个数字，其顺序是递增的。因此我们的做法可以是依次遍历，
31+
然后维护三个变量，分别记录最小值，第二小值，第三小值。只要我们能够填满这三个变量就返回true，否则返回false。
32+
33+
![334.increasing-triplet-subsequence](../assets/problems/334.increasing-triplet-subsequence.png)
34+
##关键点解析
35+
36+
- 维护三个变量，分别记录最小值，第二小值，第三小值。只要我们能够填满这三个变量就返回true，否则返回false
37+
38+
##代码
39+
```js
40+
41+
42+
/*
43+
* @lc app=leetcode id=334 lang=javascript
44+
*
45+
* [334] Increasing Triplet Subsequence
46+
*
47+
* https://leetcode.com/problems/increasing-triplet-subsequence/description/
48+
*
49+
* algorithms
50+
* Medium (39.47%)
51+
* Total Accepted: 89.6K
52+
* Total Submissions: 226.6K
53+
* Testcase Example: '[1,2,3,4,5]'
54+
*
55+
* Given an unsorted array return whether an increasing subsequence of length 3
56+
* exists or not in the array.
57+
*
58+
* Formally the function should:
59+
*
60+
* Return true if there exists i, j, k
61+
* such that arr[i] < arr[j] < arr[k] given 0 ≤ i < j < k ≤ n-1 else return
62+
* false.
63+
*
64+
* Note: Your algorithm should run in O(n) time complexity and O(1) space
65+
* complexity.
66+
*
67+
*
68+
* Example 1:
69+
*
70+
*
71+
* Input: [1,2,3,4,5]
72+
* Output: true
73+
*
74+
*
75+
*
76+
* Example 2:
77+
*
78+
*
79+
* Input: [5,4,3,2,1]
80+
* Output: false
81+
*
82+
*
83+
*
84+
*/
85+
/**
86+
*@param{number[]}nums
87+
*@return{boolean}
88+
*/
89+
varincreasingTriplet=function(nums) {
90+
if (nums.length<3)returnfalse;
91+
let n1=Number.MAX_VALUE;
92+
let n2=Number.MAX_VALUE;
93+
94+
for(let i=0; i<nums.length; i++) {
95+
if (nums[i]<= n1) {
96+
n1= nums[i]
97+
}elseif (nums[i]<= n2) {
98+
n2= nums[i]
99+
}else {
100+
returntrue;
101+
}
102+
}
103+
104+
returnfalse;
105+
};
106+
```

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp