分类: leetcode | 倪春恩的博客

倪春恩的博客

文章分类

leetcode 464 bigdata 1 默认 1 设计模式 22 其他 1 SQL 1 大数据 1

                            
                            lc-76
                        
                                //Given two strings s and t of lengths m and n respectively, return the minimum 
//window substring of s such that every
                            
                                2022-08-04
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-75
                        
                                //Given an array nums with n objects colored red, white, or blue, sort them in-p
//lace so that objects of the same colo
                            
                                2022-08-03
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-73
                        
                                //Given an m x n integer matrix matrix, if an element is 0, set its entire row a
//nd column to 0's. 
//
// You must do 
                            
                                2022-08-02
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-70
                        
                                //You are climbing a staircase. It takes n steps to reach the top. 
//
// Each time you can either climb 1 or 2 steps. I
                            
                                2022-08-01
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-69
                        
                                //Given a non-negative integer x, compute and return the square root of x. 
//
// Since the return type is an integer, t
                            
                                2022-07-29
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-66
                        
                                //You are given a large integer represented as an integer array digits, where ea
//ch digits[i] is the ith digit of the 
                            
                                2022-07-28
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-62
                        
                                //There is a robot on an m x n grid. The robot is initially located at the top-l
//eft corner (i.e., grid[0][0]). The ro
                            
                                2022-07-27
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-56
                        
                                //Given an array of intervals where intervals[i] = [starti, endi], merge all ove
//rlapping intervals, and return an arr
                            
                                2022-07-26
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-55
                        
                                //You are given an integer array nums. You are initially positioned at the array
//'s first index, and each element in t
                            
                                2022-07-22
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-54
                        
                                //Given an m x n matrix, return all elements of the matrix in spiral order.
//
//
// Example 1:
//
//
//Input: matrix = 
                            
                                2022-07-21
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-53
                        
                                //Given an integer array nums, find the contiguous subarray (containing at least
// one number) which has the largest su
                            
                                2022-07-20
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-50
                        
                                //Implement pow(x, n), which calculates x raised to the power n (i.e., xn). 
//
// 
// Example 1: 
//
// 
//Input: x = 2
                            
                                2022-07-19
                            
                                    leetcode
                                
                            leetcode

            
37 / 39