Calculator系列问题四 LeetCode 770. Basic Calculator IV

LeetCode 770. Basic Calculator IV Given an expression such as expression = “e + 8 - a + 5” and an evaluation map such as {“e”: 1} (given in terms of ...

2019-01-17 02:58:51

阅读数:71

评论数:0

Calculator系列问题三 LeetCode 772. Basic Calculator III

LeetCode 772. Basic Calculator III Implement a basic calculator to evaluate a simple expression string. The expression string may contain open ( and ...

2019-01-17 02:54:55

阅读数:64

评论数:0

Calculator系列问题二 LeetCode 227. Basic Calculator II

LeetCode 227. Basic Calculator II Implement a basic calculator to evaluate a simple expression string. The expression string contains only non-negati...

2019-01-17 02:52:18

阅读数:61

评论数:0

Calculator系列问题一 LeetCode 224. Basic Calculator

LeetCode 224. Basic Calculator Implement a basic calculator to evaluate a simple expression string. The expression string may contain open ( and clos...

2019-01-17 02:48:16

阅读数:69

评论数:0

LeetCode 340. Longest Substring with At Most K Distinct Characters

Given a string, find the length of the longest substring T that contains at most k distinct characters. Example 1: Input: s = "eceba&qu...

2019-01-09 08:35:07

阅读数:13

评论数:0

LeetCode 3. Longest Substring Without Repeating Characters

Given a string, find the length of the longest substring without repeating characters. Example 1: Input: "abcabcbb" Output: 3 Exp...

2019-01-08 17:00:06

阅读数:8

评论数:0

LeetCode 76. Minimum Window Substring

Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). Example: Input: S = &am...

2019-01-08 15:40:42

阅读数:15

评论数:0

LeetCode 159. Longest Substring with At Most Two Distinct Characters

Given a string s , find the length of the longest substring t that contains at most 2 distinct characters. Example 1: Input: "eceba&qu...

2019-01-07 15:26:41

阅读数:8

评论数:0

LeetCode 151. Reverse Words in a String

Given an input string, reverse the string word by word. Example: Input: "the sky is blue", Output: "blue is sky the&...

2019-01-07 15:25:10

阅读数:7

评论数:0

LeetCode 38. Count and Say

The count-and-say sequence is the sequence of integers with the first five terms as following: 1 11 21 1211 111221 1 is read off as ...

2019-01-07 14:14:49

阅读数:10

评论数:0

DP动态规划专题十三:LeetCode 72. Edit Distance

LeetCode 72. Edit Distance Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2. You have the fo...

2019-01-06 14:17:43

阅读数:21

评论数:0

DP动态规划专题十一:LeetCode 115. Distinct Subsequences

LeetCode 115. Distinct Subsequences Given a string S and a string T, count the number of distinct subsequences of S which equals T. A subsequence of ...

2019-01-03 16:08:00

阅读数:9

评论数:0

DP动态规划专题十:LeetCode 10. Regular Expression Matching

LeetCode 10. Regular Expression Matching Given an input string (s) and a pattern §, implement regular expression matching with support for ‘.’ and ‘*...

2019-01-03 13:48:06

阅读数:11

评论数:0

动态规划多版本iteration+recursion练习:LeetCode 139. Word Break

LeetCode 139. Word Break Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented i...

2019-01-03 07:40:27

阅读数:8

评论数:0

DP动态规划专题九:LeetCode 72. Edit Distance

LeetCode 72. Edit Distance Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2. You have the fo...

2019-01-01 03:21:07

阅读数:7

评论数:0

LeetCode 777. Swap Adjacent in LR String

LeetCode 777. Swap Adjacent in LR String In a string composed of ‘L’, ‘R’, and ‘X’ characters, like “RXXLRXRXL”, a move consists of either replacing ...

2018-12-31 10:32:37

阅读数:3

评论数:0

LeetCode 340. Longest Substring with At Most K Distinct Characters(java)

Given a string, find the length of the longest substring T that contains at most k distinct characters.For example, Given s = “eceba” and k = 2,T is ...

2018-02-12 11:49:48

阅读数:143

评论数:0

LeetCode 159. Longest Substring with At Most Two Distinct Characters(java)

Given a string, find the length of the longest substring T that contains at most 2 distinct characters.For example, Given s = “eceba”,T is "ece&...

2018-02-12 11:45:26

阅读数:88

评论数:0

LeetCode 3. Longest Substring Without Repeating Characters(java)

Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc&qu...

2018-02-12 02:08:43

阅读数:44

评论数:0

LeetCode 591. Tag Validator(java)

Given a string representing a code snippet, you need to implement a tag validator to parse the code and return whether it is valid. A code snippet is...

2018-02-11 15:50:45

阅读数:87

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭