leetcode
crazy__chen
只要有一个人爱我,懂我,愿意等我,我便勇往直前,无所不能。
展开
-
leetcode--Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. You m原创 2015-05-08 16:30:48 · 508 阅读 · 0 评论 -
leetcode--Isomorphic Strings
Given two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to gett.All occurrences of a character must be replaced with another原创 2015-05-02 14:43:13 · 479 阅读 · 0 评论 -
leetcode--Factorial Trailing Zeroes
Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.public class Solution { /** * 本质就是计算因子中5的个数 * n/5可以求出1-n有多少个数能被5原创 2015-05-02 19:02:17 · 513 阅读 · 0 评论 -
leetcode--Reverse Nodes in k-Group
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.原创 2015-05-08 17:43:12 · 543 阅读 · 0 评论 -
leetcode--Gas Station
There are N gas stations along a circular route, where the amount of gas at stationi is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from stationi to it原创 2015-05-02 14:09:34 · 613 阅读 · 0 评论 -
leetcode--Count Primes
Description:Count the number of prime numbers less than a non-negative number, npublic class Solution { public int countPrimes(int n) { if(n<2) return 0; boolean[] flag = new boolean[n原创 2015-05-02 15:17:21 · 505 阅读 · 0 评论 -
leetcode--House Robber
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent house原创 2015-05-02 16:14:36 · 519 阅读 · 0 评论 -
leetcode--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. For原创 2015-05-02 21:25:41 · 562 阅读 · 0 评论 -
leetcode--Remove Linked List Elements
Remove all elements from a linked list of integers that have value val.ExampleGiven: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6Return: 1 --> 2 --> 3 --> 4 --> 5/** * Definition for singly-l原创 2015-05-02 15:22:56 · 512 阅读 · 0 评论 -
leetcode--Reverse Bits
Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as0011100101原创 2015-05-02 16:42:36 · 531 阅读 · 0 评论 -
leetcode--Implement strStr()
Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.public class Solution { public int strStr(String haystack, String ne原创 2015-05-09 18:38:14 · 574 阅读 · 0 评论 -
leetcode--Happy Number
Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares o原创 2015-05-02 15:51:59 · 517 阅读 · 0 评论 -
leetcode--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)).解题思路:对于a,b数组(保证a长度小于b长度),要取原创 2015-05-03 00:42:52 · 600 阅读 · 0 评论 -
leetcode--Substring with Concatenation of All Words
You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) ins that is a concatenation of each word in words exactly once and w原创 2015-05-10 20:55:13 · 583 阅读 · 0 评论 -
leetcode--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 I原创 2015-05-03 09:11:49 · 686 阅读 · 0 评论 -
leecode--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 converting th原创 2015-05-03 16:57:49 · 545 阅读 · 0 评论 -
leetcode--Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.Have you thought about this?Here are some good questions to ask before coding.原创 2015-05-03 09:43:24 · 622 阅读 · 0 评论 -
leetcode--Longest Palindromic Substring
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length ofS is 1000, and there exists one unique longest palindromic substring.public class Solution {原创 2015-05-03 08:14:14 · 515 阅读 · 0 评论 -
leetcode--Longest Valid Parentheses
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the longest valid parentheses substring is "()", which原创 2015-05-12 00:05:31 · 580 阅读 · 0 评论 -
leetcode--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-05-02 20:42:34 · 629 阅读 · 0 评论 -
leetcode--Valid Sudoku
Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character'.'.A partially filled s原创 2015-05-13 00:44:35 · 572 阅读 · 0 评论 -
leetcode--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 triplet (a,b,c) m原创 2015-05-05 18:21:33 · 483 阅读 · 0 评论 -
leetcode--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 linei is at (i, ai) and (i, 0). Find原创 2015-05-05 03:54:11 · 474 阅读 · 0 评论 -
leetcode--Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.public class Solution { public String longestCommonPrefix(String[] strs) { if(strs.length==0) return "";原创 2015-05-05 04:45:11 · 556 阅读 · 0 评论 -
leetcode--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-05-05 18:41:21 · 478 阅读 · 0 评论 -
leetcode--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 string原创 2015-05-05 19:53:14 · 685 阅读 · 0 评论 -
leetcode--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 as "one 2原创 2015-05-13 18:30:47 · 589 阅读 · 0 评论 -
leetcode--Sudoku Solver
Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character '.'.You may assume that there will be only one unique solution.A sudoku puzzle.原创 2015-05-13 17:14:04 · 598 阅读 · 0 评论 -
leetcode--Multiply Strings
Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-negative.public class Solution { public String m原创 2015-05-15 23:09:27 · 608 阅读 · 0 评论 -
leetcode--First Missing Positive
Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should run in O(n) time and uses constant spa原创 2015-05-14 21:13:52 · 520 阅读 · 0 评论 -
leetcode--Combination Sum
Given a set of candidate numbers (C) and a target number (T), find all unique combinations inC where the candidate numbers sums to T.The same repeated number may be chosen from C unlimited numbe原创 2015-05-14 20:02:29 · 514 阅读 · 0 评论 -
leetcode--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 case原创 2015-05-14 22:03:57 · 586 阅读 · 0 评论 -
leetcode--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 l原创 2015-05-07 21:22:07 · 505 阅读 · 0 评论 -
leetcode--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 valid b原创 2015-05-08 00:40:47 · 522 阅读 · 0 评论 -
leetcode--Excel Sheet Column Number
Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 1 B -> 2 C -> 3 ... Z原创 2015-05-02 19:11:08 · 476 阅读 · 0 评论 -
leetcode--4Sum
Given an array S of n integers, are there elements a,b, c, and d in S such that a + b +c + d = target? Find all unique quadruplets in the array which gives the sum of target.Note:Elements原创 2015-05-07 21:48:49 · 500 阅读 · 0 评论 -
leetcode--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:"((()))", "(()())", "(())()", "()(())", "()()()"原创 2015-05-08 11:51:20 · 471 阅读 · 0 评论 -
leetcode--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. * public class L原创 2015-05-08 09:43:17 · 466 阅读 · 0 评论 -
leetcode--Word Ladder
Given two words (beginWord and endWord), and a dictionary, find the length of shortest transformation sequence frombeginWord to endWord, such that:Only one letter can be changed at a timeEach in原创 2015-06-16 20:39:25 · 623 阅读 · 0 评论 -
leetcode--Best Time to Buy and Sell Stock
Say you have an array for which the ith element is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),原创 2015-06-16 19:32:10 · 665 阅读 · 0 评论