字符串
码不停Ti
信息安全在校大学生
展开
-
557. 反转字符串中的单词 III
给定一个字符串,你需要反转字符串中每个单词的字符顺序,同时仍保留空格和单词的初始顺序。示例:输入:"Let's take LeetCode contest"输出:"s'teL ekat edoCteeL tsetnoc"提示:在字符串中,每个单词由单个空格分隔,并且字符串中不会有任何额外的空格。来源:力扣(LeetCode)链接:https://leetcode-cn.com/problems/reverse-words-in-a-string-iii著作权归领扣网络所有..原创 2020-08-30 17:20:01 · 367 阅读 · 0 评论 -
【LeetCode】72. 编辑距离
给定两个单词word1 和word2,计算出将word1转换成word2 所使用的最少操作数。你可以对一个单词进行如下三种操作:插入一个字符删除一个字符替换一个字符示例1:输入: word1 = "horse", word2 = "ros"输出: 3解释:horse -> rorse (将 'h' 替换为 'r')rorse -> rose (...原创 2020-02-03 19:00:34 · 386 阅读 · 0 评论 -
【LeetCode】49. Group Anagrams
Given an array of strings, group anagrams together.Example:Input: ["eat", "tea", "tan", "ate", "nat", "bat"],Output:[ ["ate","eat","tea"], ["nat","tan"], ["bat"]]Note:All inputs will b...原创 2019-12-10 11:40:44 · 338 阅读 · 0 评论 -
【LeetCode】 12. Integer to Roman【贪心算法】
Roman numerals are represented by seven different symbols:I, V, X, L, C, D and M.Symbol ValueI 1V 5X 10L 50C 100D ...原创 2019-12-10 10:25:42 · 392 阅读 · 0 评论 -
【LeetCode】8. 字符串转换整数 (atoi)
请你来实现一个atoi函数,使其能将字符串转换成整数。首先,该函数会根据需要丢弃无用的开头空格字符,直到寻找到第一个非空格的字符为止。当我们寻找到的第一个非空字符为正或者负号时,则将该符号与之后面尽可能多的连续数字组合起来,作为该整数的正负号;假如第一个非空字符是数字,则直接将其与之后连续的数字字符组合起来,形成整数。该字符串除了有效的整数部分之后也可能会存在多余的字符,这些字符可...原创 2019-12-09 20:04:55 · 393 阅读 · 0 评论 -
【LeetCode】13. Roman to Integer
Roman numerals are represented by seven different symbols:I, V, X, L, C, D and M.Symbol ValueI 1V 5X 10L 50C 100D ...原创 2019-10-10 16:21:43 · 341 阅读 · 0 评论 -
【Leet Code】22. Generate Parentheses
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:[ "((()))", "(()())", "(())()", "()(())",...原创 2019-10-03 16:28:48 · 337 阅读 · 0 评论 -
【Leet Code】17. Letter Combinations of a Phone Number
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) is giv...原创 2019-10-03 15:57:28 · 391 阅读 · 0 评论 -
【Leet Code】20. Valid Parentheses
Given a string containing just the characters'(',')','{','}','['and']', determine if the input string is valid.An input string is valid if:Open brackets must be closed by the same type o...原创 2019-10-03 14:26:08 · 313 阅读 · 0 评论 -
【LeetCode】5. Longest Palindromic Substring
5. Longest Palindromic SubstringGiven a strings, find the longest palindromic substring ins. You may assume that the maximum length ofsis 1000.Example 1:Input: "babad"Output: "bab"Note...原创 2019-10-03 00:15:52 · 332 阅读 · 0 评论 -
【LeetCode】6. 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 NA P L S I I ...原创 2019-09-28 17:36:58 · 364 阅读 · 0 评论