weixin_42367350的博客

Validate Stack Sequences 题目描述： Given two integer arrays pushed and popped each with distinct values, return true if this could have been the result of a sequence of push and pop operations on an initially empty stack, or false otherwise. 例子： Input: pushed

1、题目描述： Given an array of integersnumswhich is sorted in ascending order, and an integertarget, write a function to searchtargetinnums. Iftargetexists, then return its index. Otherwise, return-1. You must write an algorithm withO(log n)runti...

1、 题目： Rotate Array Given an array, rotate the array to the right by k steps, where k is non-negative. Constraints: 1 <= nums.length <= 105 -231 <= nums[i] <= 231 - 1 0 <= k <= 105 2、解答 class Solution { public: void rotate(vector<i

题目描述： Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0. A subsequence of a string is a new string generated from the original string with some characters (can be none) d