String
文章平均质量分 61
Yingying_code
这个作者很懒,什么都没留下…
展开
-
49. Group Anagrams**
Given an array of strings, group anagrams together.For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return:[ ["ate", "eat","tea"], ["nat","tan"], ["bat"]]Note: All inpu原创 2017-01-01 23:28:46 · 202 阅读 · 0 评论 -
58. Length of Last Word*
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word does not exist, return 0.Note: A word is原创 2016-12-27 21:35:35 · 246 阅读 · 0 评论 -
125. Valid Palindrome*
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Panama" is a palindrome."race a car" is not a原创 2016-12-27 22:22:37 · 263 阅读 · 0 评论 -
151. Reverse Words in a String**
Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the". public String reverseWords(String s) { String[] parts = s.tr原创 2016-12-28 21:55:46 · 280 阅读 · 0 评论 -
415. Add Strings*
Given two non-negative integers num1 and num2 represented as string, return the sum of num1 and num2.Note:The length of both num1 and num2 is Both num1 and num2 contains only digits 0-9.原创 2017-01-16 09:55:23 · 488 阅读 · 0 评论 -
438. Find All Anagrams in a String*
Given a string s and a non-empty string p, find all the start indices of p's anagrams in s.Strings consists of lowercase English letters only and the length of both strings s and p will not be lar原创 2017-01-16 10:23:01 · 232 阅读 · 0 评论 -
482. License Key Formatting**
Now you are given a string S, which represents a software license key which we would like to format. The string S is composed of alphanumerical characters and dashes. The dashes split the alphanumeric原创 2017-01-19 11:03:28 · 324 阅读 · 0 评论 -
423. Reconstruct Original Digits from English**
Given a non-empty string containing an out-of-order English representation of digits0-9, output the digits in ascending order.Note:Input contains only lowercase English letters.Input is guar原创 2017-01-19 11:21:36 · 237 阅读 · 0 评论 -
424. Longest Repeating Character Replacement**
Given a string that consists of only uppercase English letters, you can replace any letter in the string with another letter at most k times. Find the length of a longest substring containing all repe原创 2017-01-19 22:45:57 · 214 阅读 · 0 评论 -
165. Compare Version Numbers*
Compare two version numbers version1 and version2.If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0.You may assume that the version strings are non-empty and co原创 2016-12-27 21:30:47 · 243 阅读 · 0 评论 -
38. Count and Say*
The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read off原创 2016-12-25 22:22:26 · 204 阅读 · 0 评论 -
28. Implement strStr()*
Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.My code: public int strStr(String haystack, String needle) {原创 2016-12-25 21:43:42 · 192 阅读 · 0 评论 -
17. Letter Combinations of a Phone Number**
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input:Digit st原创 2017-01-02 00:00:49 · 288 阅读 · 0 评论 -
227. Basic Calculator II**
Implement a basic calculator to evaluate a simple expression string.The expression string contains only non-negative integers, +, -, *, / operators and empty spaces . The integer division should原创 2017-01-02 00:31:53 · 226 阅读 · 0 评论 -
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:[ "((()))", "(()())", "(())()", "()(())原创 2017-01-02 01:04:02 · 187 阅读 · 0 评论 -
3. Longest Substring Without Repeating Characters**
Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc", which the length is 3.Given "bbbbb", the answer is "原创 2017-01-03 21:15:57 · 176 阅读 · 0 评论 -
290. Word Pattern*
Given a pattern and a string str, find if str follows the same pattern.Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.原创 2017-01-03 21:41:29 · 203 阅读 · 0 评论 -
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原创 2016-12-24 22:37:34 · 209 阅读 · 0 评论 -
14. Longest Common Prefix**
Write a function to find the longest common prefix string amongst an array of strings.Method1:public class Solution { public String longestCommonPrefix(String[] strs) { if(strs==null |原创 2016-12-25 20:12:15 · 219 阅读 · 0 评论 -
434. Number of Segments in a String*
Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters.Please note that the string does not contain any non-printable characters.原创 2016-12-25 20:48:39 · 264 阅读 · 0 评论 -
385. Mini Parser**
Given a nested list of integers represented as a string, implement a parser to deserialize it.Each element is either an integer, or a list -- whose elements may also be integers or other lists.原创 2017-02-25 21:23:41 · 285 阅读 · 0 评论