Leet Code
Anyanyamy
这个作者很懒,什么都没留下…
展开
-
Leet Code 10 Regular Expression Matching
Implement regular expression matching with support for '.' and '*'.'.' Matches any single character.'*' Matches zero or more of the preceding element.The matching should cover the entire input st转载 2015-09-09 08:16:35 · 366 阅读 · 0 评论 -
Leet Code 19 Remove Nth Node From End of List
Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the原创 2015-09-12 03:02:24 · 273 阅读 · 0 评论 -
Leet Code 11 Container With Most Water
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Fin原创 2015-09-10 21:38:01 · 326 阅读 · 0 评论 -
Leet Code 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 input ca原创 2015-09-09 07:08:41 · 297 阅读 · 0 评论 -
Leet Code 7 Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321Have you thought about this?Here are some good questions to ask before coding. Bonus points for you原创 2015-09-08 21:21:14 · 313 阅读 · 0 评论 -
Leet Code 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-09-08 01:59:26 · 395 阅读 · 0 评论 -
Leet Code Medium 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 a link原创 2015-09-08 00:03:09 · 350 阅读 · 0 评论 -
Leet Code Medium 18 4Sum
http://tech-wonderland.net/blog/summary-of-ksum-problems.html转载 2015-09-12 02:59:07 · 371 阅读 · 0 评论 -
Leet Code Medium 15 3Sum
【题目】Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a tr转载 2015-09-11 21:01:11 · 429 阅读 · 0 评论 -
Leet Code 9 Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of convert原创 2015-09-09 08:02:20 · 284 阅读 · 0 评论 -
Leet Code 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)).搜了一下leetcode的难度转载 2015-09-08 00:30:06 · 302 阅读 · 0 评论 -
Leet Code 20 Valid Parentheses
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are all va原创 2015-09-12 03:08:00 · 277 阅读 · 0 评论 -
Leet Code 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原创 2015-09-08 20:56:22 · 323 阅读 · 0 评论 -
Leet Code 14 Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings思路:找最短的一个串,然后与其他串每个字符比较public String longestCommonPrefix(String[] strs) { if(strs.length == 0)转载 2015-09-11 20:56:30 · 354 阅读 · 0 评论 -
Leet Code Medium 1 two sum
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, where i原创 2015-09-07 23:57:12 · 429 阅读 · 0 评论 -
Leet Code 21 Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists/** * Definition for singly-linked list. * publi原创 2015-09-12 11:05:48 · 297 阅读 · 0 评论 -
Leet Code 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转载 2015-09-12 01:43:38 · 283 阅读 · 0 评论 -
Leet Code Medium 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. Fo原创 2015-09-08 00:26:10 · 313 阅读 · 0 评论 -
Leet Code Medium 16 3Sum Closest
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly转载 2015-09-11 21:02:49 · 309 阅读 · 0 评论 -
Leet Code 12 & 13 Integer <---> Roman
Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999. public String intToRoman(int number) { int[] values = {1000, 900, 500转载 2015-09-11 20:53:25 · 298 阅读 · 0 评论