m0_37628648的博客

Week2Program--MediumGiven a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys

Week16Problem--Medium--392. Is SubsequenceGiven a string s and a string t, check if s is subsequence of t.You may assume that there is only lower case English letters in both s and t. t is

Week14Problem--Medium--647. Palindromic SubstringsGiven a string, your task is to count how many palindromic substrings in this string.The substrings with different start indexes or end in

Week12Problem--Medium--714. Best Time To Buy and Sell Stock with Transaction FeeYour are given an array of integers prices, for which the i-th element is the price of a given stock on day i;

Week14Problem--Medium--646. Maximum Length of Pair ChainYou are given n pairs of numbers. In every pair, the first number is always smaller than the second number.Now, we define a pair (c,

Week11Problem--Medium--718. Maximum Length of Repeated SubarrayGiven two integer arrays A and B, return the maximum length of an subarray that appears in both arrays.Example 1:Input:A

Week13Problem--Medium--673. Number of Longest Increasing SubsequenceGiven an unsorted array of integers, find the number of longest increasing subsequence.Example 1:Input: [1,3,5,4,7]Ou

Week9Problem--Medium--338. Counting BitsGiven a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and r

Week10Problem--Medium--413. Arithmetic SlicesA sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is t

Week7Program--Medium--537.Complex Number MultiplicationGiven two strings representing two complex number.You need to return a string representing their multiplication. Note i2 = -1 according

Week6Program--Medium--419. Battleships in a BoardGiven an 2D board, count how many battleships are in it. The battleships are represented with 'X's, empty slots are represented with '.'s. Yo

Week8Program--Medium--712.Minimum ASCII Delete Sum for Two StringsGiven two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal.Example 1:Input:

Week3Program--Medium--399. Evaluate DivisionEquations are given in the format A / B = k, where A and B are variables represented as strings, and k is a real number (floating point number). G

Week5Program--Medium--611. Valid Triangle NumberGiven an array consists of non-negative integers, your task is to count the number of triplets chosen from the array that can make triangles if

Week3Program--MediumDesign a data structure that supports the following two operations:void addWord(word)bool search(word)search(word) can search a literal word or a regular expression

Week1

Week17Problem--8.19A kite is a graph on an even number of vertices, say 2n, in which n of the vertices form a clique and the remaining n vertices are connected in a "tail" that consists of a path