DaMoWangZQ的博客

题目描述：Given a string S, we can transform every letter individually to be lowercase or uppercase to create another string. Return a list of all possible strings we could create.Examples:Input: S = “a1b2”Output: [“a1b2”, “a1B2”, “A1b2”, “A1B2”]Input: S

题目描述：Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area.Example:Input:1 0 1 0 01 0 1 1 11 1 1 1 11 0 0 1 0Output: 4题目大意：给定你一个二维的列表，列表中的每个元素都是0，1字符串让你找出只包含字符1的正方形，且其面积最大，输出其面积值解题思路

题目描述：Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product.Example 1:Input: [2,3,-2,4]Output: 6Explanation: [2,3] has the largest product 6.Example 2:Input: [-2,0,-1]

题目描述：Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words.Note:The same word in the dictionary may be reused multiple t

题目描述：Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangleThe minimum path sum from top to bottom is 11 (i.e., 2 + 3 + 5 + 1 = 11).Note:Bo

题目描述：A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked ‘Finish’ in t

题目描述：Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at any point in time.Example:Input:[[1,3,1],[1,5,1

题目描述：On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed).Once you pay the cost, you can either climb one or two steps. You need to find minimum cost to reach the top of the floor, and you can either start from the step w

题目描述：Given 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 potentially a very long (length ~= 500,000) string, and s is a short string (<=100).A subsequence

题目描述：Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine if you are able to reach the last index.Example 1:Input

题目描述：A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach t...

题目描述：You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first hou...

题目描述：You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent...

题目描述：Given an unsorted integer array, find the smallest missing positive integer.Example 1:Input: [1,2,0]Output: 3Example 2:Input: [3,4,-1,1]Output: 2Example 3:Input: [7,8,9,11,12]Output: 1...

题目描述：Given a non-empty array of digits representing a non-negative integer, plus one to the integer.The digits are stored such that the most significant digit is at the head of the list, and each el...

题目描述：Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the arr...

题目描述：Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy...

题目描述：Say you have an array prices for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (...

题目描述：Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of the st...

题目描述：You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?Note: Given n will be a posi...

先说大感谢：此篇文章的成型，要特别感谢一个人，labuladong，东哥，算法界一哥，扛把子，得益于他的指点在此也推荐他的公众号，以及他的GitHub仓库，现在已经很火了，公众号：labuladong，GitHub：手把手教你扒LeetCode的裤子，因为很火爆，也很实用，大家应该能找得到，希望看到并感兴趣的朋友，也去学一学好了，开始了题目描述：Given an integer ...

题目描述：Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input ...

题目描述：Implement strStr().Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Example 1:Input: haystack = “hello”, needle = “ll”Output: 2Example...

题目描述：Given a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring.Example 1:Input: “(()”Output: 2Explanation: The longest va...

先聊一聊背景如题目所述，这道LeetCode经典算法题，中文名称是正则表达式匹配，如果你已经是刷题的高手，或者还是刚刚刷题的新手，比如我。那么你一定在LeetCode遇到过这道题。那么对于我这个刚刚上路的新手来说，因为这道题的排序是第十位，而我刷题是按照顺序来的，所以很快就遇到了它，结果就是跳过了。。。当时也在网上找过一些答案，基本两种解法最流行吗，其一，是递归；也就是本文将要解释的。其二，...

题目描述：Given a collection of numbers that might contain duplicates, return all possible unique permutations.Example:Input: [1,1,2]Output:[[1,1,2],[1,2,1],[2,1,1]]题目大意：给定一个数组，但是包含重复的数字，返回所有的不...

题目描述：Given a collection of distinct integers, return all possible permutations.Example:Input: [1,2,3]Output:[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]题目大意：如题目所示，意为排列，置换，也就是将给定的数组...

题目描述：Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.Each number in candidate...

题目描述：Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.The same r...

题目描述：Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:[“((()))”,“(()())”,“(())()”,“()(())”,“()...

题目描述：Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) i...

题目描述：Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest possi...

题目描述：Given an array nums and a value val, remove all instances of that value in-place and return the new length.Do not allocate extra space for another array, you must do this by modifying the input...

题目描述：Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example 1:Input: “babad”Output: “bab”Note: “aba” is also a valid answer.Ex...

题目描述：Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find...

题目描述：Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum ...

题目描述：Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:The solution set must not ...

声明：因本人为AI路上的新手，文章用于辅助个人的整理记忆，理解难免有偏差之处，都是个人拙见，如给其他同僚造成困扰，还请见谅，非常非常非常欢迎私信共同讨论，共同进步题目描述：Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.Symbol ValueI ...

声明：因本人为AI路上的新手，文章用于辅助个人的整理记忆，理解难免有偏差之处，都是个人拙见，如给其他同僚造成困扰，还请见谅，非常非常非常欢迎私信共同讨论，共同进步题目描述：Implement atoi which converts a string to an integer.The function first discards as many whitespace characters...

声明：因本人为AI路上的新手，文章用于辅助个人的整理记忆，理解难免有偏差之处，都是个人拙见，如给其他同僚造成困扰，还请见谅，非常非常非常欢迎私信共同讨论，共同进步题目描述：Given a string, find the length of the longest substring without repeating characters.Example 1:Input: “abcab...