LEETCODE
小菜鸟快点儿飞
这个作者很懒,什么都没留下…
展开
-
Best Time to Buy and Sell Stock III
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 at most two transactions.Note: You may not eng...原创 2020-02-12 17:27:56 · 154 阅读 · 0 评论 -
LeetCode-Best Time to Buy and Sell Stock IV(JAVA)
Say you have an array for which the i-th element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most k transactions.Note:You may not enga...原创 2020-02-12 17:22:14 · 185 阅读 · 0 评论 -
LeetCode-Distinct Subsequences(JAVA)
Given a string S and a string T, count the number of distinct subsequences of S which equals T.A subsequence of a string is a new string which is formed from the original string by deleting some (can...原创 2020-02-10 22:02:25 · 132 阅读 · 0 评论 -
LeetCode-Interleaving String(JAVA)
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation of s1 = “great”:great/ gr eat/ \ ...原创 2020-02-10 00:27:14 · 127 阅读 · 0 评论 -
LeetCode-Scramble String(JAVA)
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation of s1 = “great”:great/ gr eat/ \ ...原创 2020-02-10 00:24:40 · 136 阅读 · 0 评论 -
LeetCode-Maximal Rectangle(JAVa)
Given a 2D binary matrix filled with 0’s and 1’s, find the largest rectangle containing only 1’s and return its area.说明:参考LeetCode-Largest Rectangle in Histogram(JAVA)针对二维数组的每一行,生成直方图,求出该直方图中的最大矩形。...原创 2020-02-09 21:25:49 · 295 阅读 · 0 评论 -
LeetCode-Largest Rectangle in Histogram(JAVA)
Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.class Solution { public int largestRec...原创 2020-02-09 21:22:19 · 316 阅读 · 0 评论 -
LeetCode-Wildcard Matching (JAVA)
Given an input string (s) and a pattern §, implement wildcard pattern matching with support for ‘?’ and ‘*’.‘?’ Matches any single character.‘*’ Matches any sequence of characters (including the emp...原创 2020-02-08 17:50:56 · 118 阅读 · 0 评论 -
LeetCode- Longest Valid Parentheses(JAVA)
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 valid pa...原创 2020-02-08 17:13:26 · 151 阅读 · 0 评论 -
Leetcode-Regular Expression Matching(JAVA)
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 element.The ...原创 2020-02-07 20:30:22 · 189 阅读 · 0 评论 -
LeetCode-Maximal Square(JAVA)
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填充组成的...原创 2020-02-05 22:03:16 · 149 阅读 · 0 评论 -
LeetCode-Maximum Product Subarray(JAVA)
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: 6 Explanation: [2,3] has...原创 2020-02-02 17:32:16 · 166 阅读 · 0 评论 -
LeetCode-Word Break(JAVA)
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 sa...原创 2020-02-02 17:23:11 · 119 阅读 · 0 评论 -
LeetCode-Unique Binary Search Trees II(JAVA)
Given an integer n, generate all structurally unique BST’s (binary search trees) that store values 1 … n.Example:Input: 3Output:[ [1,null,3,2], [3,2,null,1], [3,1,null,null,2], [2,1,3], ...原创 2020-02-02 17:05:18 · 152 阅读 · 0 评论 -
LeetCode-Unique Binary Search Trees(JAVA)
Given n, how many structurally unique BST’s (binary search trees) that store values 1 … n?Example:Input: 3 Output: 5 Explanation: Given n = 3, there are a total of 5unique BST’s:1 3 3...原创 2020-02-02 16:38:09 · 179 阅读 · 0 评论 -
LeetCode-Longest Palindromic Substring(JAVA)
Given a string s, find the longest palindromic substring in s. You mayassume that the maximum length of s is 1000.Example 1:Input: “babad” Output: “bab” Note: “aba” is also a valid answer.Example...原创 2019-12-25 21:23:29 · 109 阅读 · 0 评论 -
LeetCode-Edit Distance(JAVA)
Given two words word1 and word2, find the minimum number of operationsrequired to convert word1 to word2.You have the following 3 operations permitted on a word:Insert a character Delete a charact...原创 2019-12-25 21:13:54 · 110 阅读 · 0 评论 -
LeetCode-Majority Element II (JAVA)
Given an integer array of size n, find all elements that appear morethan ⌊ n/3 ⌋ times.Note: The algorithm should run in linear time and in O(1) space.Example 1:Input: [3,2,3] Output: [3] Example...原创 2019-12-24 22:23:57 · 133 阅读 · 0 评论 -
LeetCode-Combination Sum II (JAVA)
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 candidates may...原创 2019-12-20 19:59:10 · 163 阅读 · 0 评论 -
LeetCode-combination-sum (JAVA)
Given a set of candidate numbers (candidates) (without duplicates) anda target number (target), find all unique combinations in candidateswhere the candidate numbers sums to target.The same repeat...原创 2019-12-20 19:40:14 · 109 阅读 · 0 评论 -
LeetCode- Find First and Last Position of Element in Sorted Array (JAVA)
Given an array of integers nums sorted in ascending order, find thestarting and ending position of a given target value.Your algorithm’s runtime complexity must be in the order of O(log n).If the ...原创 2019-12-19 18:08:50 · 128 阅读 · 0 评论 -
LeetCod-Search in Rotated Sorted Array (Java)
Suppose an array sorted in ascending order is rotated at some pivotunknown to you beforehand.(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).You are given a target value to search. If found i...原创 2019-12-19 17:58:24 · 114 阅读 · 0 评论 -
LEET CODE-Next Permutation(JAVA)
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 possible o...原创 2019-12-19 17:06:36 · 112 阅读 · 0 评论 -
LeetCode-Word Break
Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, given s = “leetcode”, dict = [“leet”, “co原创 2015-07-06 17:18:52 · 294 阅读 · 0 评论 -
Leetcode-Regular Expression Matching(C++)
Implement regular expression matching with support for ‘.’ and ‘*’.‘.’ Matches any single character. ‘*’ Matches zero or more of the preceding element.The matching should cover the entire input string原创 2015-07-07 13:04:54 · 400 阅读 · 0 评论 -
Leetcode-Word Break II
Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.Return all such possible sentences.For example, given s = “catsanddo原创 2015-07-06 17:26:40 · 382 阅读 · 0 评论 -
LeetCode-ZigZag Conversion
The string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H N A P L S I I G原创 2015-06-29 22:21:14 · 374 阅读 · 0 评论 -
LeetCode-Valid Number
Validate if a given string is numeric.Some examples: “0” => true ” 0.1 ” => true “abc” => false “1 a” => false “2e10” => true Note: It is intended for the problem statement to be ambiguous. You s原创 2015-06-29 11:15:25 · 259 阅读 · 0 评论 -
LeetCode之Rotate Array(C++)
Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note: Try to come up as many solutions as you can, ther原创 2015-03-17 16:12:45 · 475 阅读 · 1 评论 -
LeetCod之Search in Rotated Sorted Array (C++)
Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If found in the array return its index原创 2015-04-25 21:27:34 · 354 阅读 · 0 评论 -
LeetCode之Search Insert Position(C++)
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 array. H原创 2015-04-25 16:28:04 · 359 阅读 · 0 评论 -
LeetCode之Search in Rotated Sorted Array II ()C++
Follow up for “Search in Rotated Sorted Array”: What if duplicates are allowed?Would this affect the run-time complexity? How and why?Write a function to determine if a given target is in the array.原创 2015-04-25 21:29:15 · 286 阅读 · 0 评论 -
Leetcode-Permutations II
Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example, [1,1,2] have the following unique permutations: [1,1,2], [1,2,1], and [2,1,1]. 题意:对一原创 2015-07-14 19:07:31 · 280 阅读 · 0 评论 -
Leetcode-N-Queens II
Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.题意:对于一个n皇后问题,返回解的个数 解题思路:基于N-Queens,这个II版的反而更简单,记录解的个数并返回即可。bool iv(vector<in原创 2015-07-14 19:18:33 · 376 阅读 · 0 评论 -
Leetcode-N-Queens
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to the n-queens puzzle.Each solut原创 2015-07-14 19:14:21 · 357 阅读 · 0 评论 -
LeetCode-Basic Calculator
Implement a basic calculator to evaluate a simple expression string.The expression string may contain open ( and closing parentheses ), the plus + or minus sign -, non-negative integers and empty space原创 2015-06-28 22:36:52 · 604 阅读 · 0 评论 -
LeetCode-Add and Search Word - Data structure design(C++)
Design 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 string containing only letters a原创 2015-07-18 21:22:24 · 398 阅读 · 0 评论 -
leetCode-Add Binary(c++)
Given two binary strings, return their sum (also a binary string).For example, a = “11” b = “1” Return “100”. 题意:给定两个二进制的字符串,计算其和思路:将两个字符串按照长度分为大字符串和小字符串,末尾对齐,在低位,即小字符串的范围相加,进位保留,然后将保留的进位与大字符串高位,即大原创 2015-06-27 21:59:52 · 323 阅读 · 0 评论 -
LeetCode-Implement Trie (Prefix Tree) (C++)
Implement a trie with insert, search, and startsWith methods.Note: You may assume that all inputs are consist of lowercase letters a-z. 题意:实现一个字典树(前缀树),包含查找、插入功能。 参考文章:字典树(Prefix Tree)注意:查找一个word是否在原创 2015-07-18 20:09:49 · 674 阅读 · 0 评论 -
Leetcode-Implement Queue using Stacks(C++)
Implement the following operations of a queue using stacks.push(x) – Push element x to the back of queue. pop() – Removes the element from in front of queue. peek() – Get the front element. empty()原创 2015-07-18 20:24:38 · 502 阅读 · 0 评论