上一页 1 ··· 36 37 38 39 40 41 42 43 44 ··· 48 下一页
摘要: Given an input string, reverse the string word by word. For example,Given s = "the sky is blue",return "blue is sky the". 题目含义:翻转字符串中的单词的顺序,单词内容不变 阅读全文
posted @ 2017-10-18 10:55 daniel456 阅读(92) 评论(0) 推荐(0) 编辑
摘要: Given a string containing only digits, restore it by returning all possible valid IP address combinations. For example:Given "25525511135", return ["2 阅读全文
posted @ 2017-10-18 10:50 daniel456 阅读(137) 评论(0) 推荐(0) 编辑
摘要: A message containing letters from A-Z is being encoded to numbers using the following mapping: Given an encoded message containing digits, determine t 阅读全文
posted @ 2017-10-18 10:18 daniel456 阅读(129) 评论(0) 推荐(0) 编辑
摘要: Given an absolute path for a file (Unix-style), simplify it. For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c" 题目含义:简化unix路径 阅读全文
posted @ 2017-10-18 10:08 daniel456 阅读(96) 评论(0) 推荐(0) 编辑
摘要: Given an array of strings, group anagrams together. For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return: Note: All inputs will be i 阅读全文
posted @ 2017-10-18 10:05 daniel456 阅读(89) 评论(0) 推荐(0) 编辑
摘要: Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2. Note: 题目含义:计算两个非负整数的乘法,并用string返回 思路: 方法二: 阅读全文
posted @ 2017-10-17 17:05 daniel456 阅读(106) 评论(0) 推荐(0) 编辑
摘要: 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: 阅读全文
posted @ 2017-10-17 17:01 daniel456 阅读(108) 评论(0) 推荐(0) 编辑
摘要: Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telepho 阅读全文
posted @ 2017-10-17 16:55 daniel456 阅读(128) 评论(0) 推荐(0) 编辑
摘要: Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below 阅读全文
posted @ 2017-10-17 16:43 daniel456 阅读(98) 评论(0) 推荐(0) 编辑
摘要: Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example: Example: 阅读全文
posted @ 2017-10-17 16:38 daniel456 阅读(138) 评论(0) 推荐(0) 编辑
上一页 1 ··· 36 37 38 39 40 41 42 43 44 ··· 48 下一页