Problem Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn’t one, return 0 instead. Example Input:

Problem Given two binary strings, return their sum (also a binary string). The input strings are both non-empty and contains only characters 1 or 0. Constraints: Each string consists only of ‘0’ or

Problem Given an input string (s) and a pattern §, implement regular expression matching with support for ‘.’ and ‘*’. ‘.’ Matches any single character. ‘*’ Matches zero or more of the preceding el

Problem Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. Note: For the purpose of this problem, we define empty string as valid palindrom

Problem Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string “”. All given inputs are in lowercase letters a-z

Problem 给定一个数字，我们按照如下规则把它翻译为字符串：0 翻译成 “a” ，1 翻译成 “b”，……，11 翻译成 “l”，……，25 翻译成 “z”。一个数字可能有多个翻译。请编程实现一个函数，用来计算一个数字有多少种不同的翻译方法。 Example 输入: 12258 输出: 5 解释: 12258有5种不同的翻译，分别是"bccfi", “bwfi”, “bczi”, “m

Problem Given an array equations of strings that represent relationships between variables, each string equations[i] has length 4 and takes one of two different forms: “a==b” or “a!=b”. Here, a and b

Problem 求 1+2+…+n ，要求不能使用乘除法、for、while、if、else、switch、case等关键字及条件判断语句（A?B:C）。 Example1 输入: n = 3 输出: 6 Example2 输入: n = 9 输出: 45 Constraints 1 <= n <= 10000 Solution 逻辑短路+递归 class Solu

Problem 用两个栈实现一个队列。队列的声明如下，请实现它的两个函数 appendTail 和 deleteHead ，分别完成在队列尾部插入整数和在队列头部删除整数的功能。(若队列中没有元素，deleteHead 操作返回 -1 ) Example1 输入： [“CQueue”,“appendTail”,“deleteHead”,“deleteHead”] [[],[3],[],[]

2020.06.27   17：34分  肉包永远的离开了我们  去了喵星球 他肯定回去当他的小王子去了 那么高冷帅气； 本来打算让肉包再陪伴一周  下去的时候鼻子出现了黄色的鼻涕  我就觉得不对劲了  赶紧联系wyj回来一起送肉包安乐 因为不想让他更加痛苦 他很坚强 从发病到去喵星球坚持了将近两个月 也许对我们也是有很多的不舍  腿也不舒服的他并没有表现出来不能行走 临走还是蹦蹦跳跳的  虽然