richarddia的博客

132 Pattern题目思路分析用set来求解c++里面用set的lower_bound和upper_bound小心踩坑用stack求解stack求解代码 题目 Given a sequence of n integers a1, a2, …, an, a 132 pattern is a subsequence ai, aj, ak such that i < j < k and ai < ak < aj. Design an algorithm that takes a lis

LeetCode 1545. Find Kth Bit in Nth Binary String题目描述思路代码复杂度分析 题目描述 Given a string s of lower and upper case English letters. A good string is a string which doesn’t have two adjacent characters s[i] and s[i + 1] where: 0 <= i <= s.length - 2 s[i] is