Java
边城浪子1229
数据挖掘/机器学习
展开
-
LeetCode(4)--Median of Two Sorted Arrays
题目如下: There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).解题思路: 思路1:最直接的一种思路就是将两原创 2015-11-30 14:17:41 · 251 阅读 · 0 评论 -
LeetCode(7) -- Reverse Integer
题目如下: Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321解题思路: 将x从各位逐个往后取,然后依次放到y的变量中,一个简单的代码实现如提交的代码。该问题需要考虑的问题,对于反转的数不能溢出。 提交的代码: public int reverse(int原创 2015-12-03 21:48:30 · 340 阅读 · 0 评论 -
LeetCode(8)--String to Integer (atoi)
题目如下: 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 and ask yourself what are the possible inpu原创 2015-12-03 21:58:59 · 342 阅读 · 0 评论 -
LeetCode(9)--Palindrome Number
题目如下: Determine whether an integer is a palindrome. Do this without extra space.解题解题思路: 该问题最大的难道在于无额外的空间,如果没有此限制,可以将数字转换成String然后对String反转比较两个字符串是否相等就可以了,但是,既然有了此限制,就得去想其他方法了。先借用一个中间变量判断该数字的长度,然后根据数的原创 2015-12-03 22:06:13 · 310 阅读 · 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 N A P L原创 2015-12-01 16:18:40 · 321 阅读 · 0 评论 -
LeetCode(5)--Longest Palindromic Substring
题目如下: Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.解题思路: 本题与判断回文还有一些区别原创 2015-12-01 11:25:37 · 340 阅读 · 0 评论 -
LeetCode(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原创 2015-12-01 10:48:59 · 362 阅读 · 0 评论 -
LeetCode(2)--Add Two Numbers
题目如下: You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as原创 2015-11-29 21:23:27 · 308 阅读 · 0 评论 -
LeetCode(3)--Longest Substring Without Repeating Characters
题目如下: Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for “abcabcbb” is “abc”, which the length is 3原创 2015-11-29 21:54:08 · 426 阅读 · 0 评论 -
LeetCode(1)--Two Sum
题目如下: Given an array of integers, find two numbers such that they add up to a specific target number.原创 2015-11-29 21:09:33 · 310 阅读 · 0 评论