算法
nuaazhaofeng
爱生活,爱coding
展开
-
LeetCode-1.Two Sum
1.题目描述Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may not use the sa原创 2017-02-06 11:43:46 · 364 阅读 · 0 评论 -
LeetCode-7. Reverse Integer
1.题目描述Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321Note:The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed i原创 2017-02-07 09:35:27 · 413 阅读 · 0 评论 -
LeetCode-9. Palindrome Number(回文数)
1.题目描述Determine whether an integer is a palindrome. Do this without extra space.Some hints: Could negative integers be palindromes? (ie, -1)If you are thinking of converting the integer to string, not原创 2017-02-07 21:23:51 · 397 阅读 · 0 评论 -
LeetCode-2. Add Two Numbers(链表实现数字相加)
1.题目描述You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and ret原创 2017-02-09 09:56:55 · 420 阅读 · 0 评论 -
LeetCode-3. Longest Substring Without Repeating Characters
1.题目描述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 i原创 2017-02-12 20:44:29 · 221 阅读 · 0 评论 -
LeetCode-13. Roman to Integer(罗马数字转阿拉伯数字)
1.题目描述Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.2.我的分析思路罗马数字转成阿拉伯数字,这里面需要知道罗马数字的构成规则。罗马数字通过7个不同字母的重复或组合,能够表示出所有正整数(罗马数字中没有0)。 I = 1 V = 5原创 2017-02-12 20:59:27 · 442 阅读 · 0 评论 -
LeetCode-14. Longest Common Prefix
1.题目描述Write a function to find the longest common prefix string amongst an array of strings.找到一组字符串的最长前缀。2.我的分析思路这一题的第一思路就是,把第一个字符串作为基准,遍历每个子字符串,然后判断其他字符串是否以这个子字符串为前缀,然后求出最长的即可。上代码:public String longes原创 2017-02-12 21:06:37 · 430 阅读 · 0 评论