一只快乐的小蒟蒻~

【LeetCode Solutions】LeetCode 176 ~ 180 题解

【LeetCode Solutions】LeetCode 171 ~ 175 题解

【LeetCode Solutions】LeetCode 166 ~ 169 题解

【LeetCode Solutions】LeetCode 160 ~ 165 题解

【LeetCode Solutions】LeetCode 151 ~ 155 题解

【LeetCode Solutions】LeetCode 146 ~ 150 题解

【LeetCode Solutions】LeetCode 141 ~ 145 题解

【LeetCode Solutions】LeetCode 136 ~ 140 题解

【LeetCode Solutions】LeetCode 131 ~ 135 题解

【LeetCode Solutions】LeetCode 126 ~ 130 题解

【LeetCode Solutions】LeetCode 121 ~ 125 题解

【LeetCode Solutions】LeetCode 116 ~ 120 题解

【LeetCode Solutions】LeetCode 111 ~ 115 题解

【LeetCode Solutions】LeetCode 106 ~ 110 题解

【LeetCode Solutions】LeetCode 101 ~ 105 题解

【LeetCode Solutions】LeetCode 96 ~ 100 题解

【LeetCode Solutions】LeetCode 91 ~ 95 题解

【LeetCode Solutions】LeetCode 86 ~ 90 题解

【LeetCode Solutions】LeetCode 81 ~ 85 题解

【LeetCode Solutions】LeetCode 76 ~ 80 题解

【LeetCode Solutions】LeetCode 71 ~ 75 题解

【LeetCode Solutions】LeetCode 66 ~ 70 题解

【LeetCode Solutions】LeetCode 61 ~ 65 题解

【LeetCode Solutions】LeetCode 56 ~ 60 题解

【LeetCode Solutions】LeetCode 51 ~ 55 题解

【LeetCode Solutions】LeetCode 46 ~ 50 题解

【LeetCode Solutions】LeetCode 41 ~ 45 题解

【LeetCode Solutions】LeetCode 36 ~ 40 题解

【LeetCode Solutions】LeetCode 31 ~ 35 题解

【LeetCode Solutions】LeetCode 26 ~ 30 题解

【LeetCode Solutions】LeetCode 21 ~ 25 题解

【LeetCode Solutions】LeetCode 16 ~ 20 题解

【LeetCode Solutions】LeetCode 11 ~ 15 题解

【LeetCode Solutions】LeetCode 6 ~ 10 题解

【LeetCode Solutions】LeetCode 1 ~ 5 题解

【题目描述】给你一个整数数组nums，数组中共有nnn个整数。132132132模式的子序列由三个整数nums[i]、nums[j]和nums[k]组成，并同时满足：i<j<ki<j<ki<j<k和nums[i]<nums[k]<nums[j]nums[i]<nums[k]<nums[j]nums[i]<nums[k]<nums[j]。如果nums中存在132132132模式的子序列，返回true；否则，返回false。【示例1】