基础--5.算法(LeetCode)
咸鱼的梦想
这个作者很懒,什么都没留下…
展开
-
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.[java] view plain copy/** * Defi转载 2017-08-08 08:58:19 · 165 阅读 · 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转载 2017-08-08 08:56:48 · 129 阅读 · 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:Element转载 2017-08-08 08:54:41 · 75 阅读 · 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转载 2017-08-08 08:53:14 · 58 阅读 · 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.[java] view plain copypublic class Solution转载 2017-08-08 08:31:45 · 81 阅读 · 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 ...转载 2017-08-08 08:32:41 · 112 阅读 · 0 评论 -
leetcode--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, whe转载 2017-08-08 08:34:02 · 87 阅读 · 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转载 2017-08-08 08:35:17 · 76 阅读 · 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转载 2017-08-08 08:36:43 · 54 阅读 · 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长度),转载 2017-08-08 08:38:15 · 155 阅读 · 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转载 2017-08-08 08:40:47 · 65 阅读 · 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 c转载 2017-08-08 08:41:55 · 233 阅读 · 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 convert转载 2017-08-08 08:44:36 · 77 阅读 · 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 line i is at (i, ai) and (i, 0). Find tw转载 2017-08-08 08:46:25 · 69 阅读 · 0 评论 -
leetcode--Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.[java] view plain copypublic class Solution { public String longestCommonPrefix(Str转载 2017-08-08 08:47:35 · 157 阅读 · 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)转载 2017-08-08 08:48:52 · 194 阅读 · 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转载 2017-08-08 08:49:55 · 84 阅读 · 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 st转载 2017-08-08 08:51:15 · 88 阅读 · 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) in s that is a concatenation of each word in words exactly once and转载 2017-08-08 09:09:32 · 63 阅读 · 0 评论 -
leetcode--Next Permutation
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest possible转载 2017-08-08 09:08:00 · 134 阅读 · 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.[java] view plain copypublic class Solution转载 2017-08-08 09:06:58 · 167 阅读 · 0 评论 -
leetcode--Remove Element
Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't matter what you leave beyond the new length.转载 2017-08-08 09:05:49 · 85 阅读 · 0 评论 -
leetcode--Remove Duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appear onlyonce and return the new length.Do not allocate extra space for another array, you must do this in place with转载 2017-08-08 09:04:41 · 78 阅读 · 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转载 2017-08-08 09:03:05 · 70 阅读 · 0 评论 -
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. Y转载 2017-08-08 09:01:44 · 118 阅读 · 0 评论 -
leetcode--Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.[java] view plain copy/** * Definition for singly-linked list. * public转载 2017-08-08 09:00:55 · 61 阅读 · 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:"((()))", "(()())", "(())()", "()(())", "()()转载 2017-08-08 08:59:26 · 164 阅读 · 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 ca转载 2017-08-08 09:27:54 · 284 阅读 · 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转载 2017-08-08 09:25:52 · 58 阅读 · 0 评论 -
leetcode--Combination Sum II
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations inC where the candidate numbers sums to T.Each number in C may only be used once in the combinatio转载 2017-08-08 09:24:53 · 87 阅读 · 0 评论 -
leetcode--Combination Sum
Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen from C unlimited number转载 2017-08-08 09:23:45 · 147 阅读 · 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转载 2017-08-08 09:18:39 · 72 阅读 · 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转载 2017-08-08 09:17:21 · 62 阅读 · 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 fille转载 2017-08-08 09:16:03 · 144 阅读 · 0 评论 -
leetcode--Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array.转载 2017-08-08 09:14:42 · 64 阅读 · 0 评论 -
leetcode--Search for a Range
Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If the target is not found转载 2017-08-08 09:13:50 · 138 阅读 · 0 评论 -
leetcode--Search in Rotated Sorted Array
Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If found in the array return转载 2017-08-08 09:12:01 · 62 阅读 · 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 "()", whic转载 2017-08-08 09:10:28 · 64 阅读 · 0 评论 -
leetcode--Trapping Rain Water
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example, Given [0,1,0,2,1,0,1,3,2,1,2,1]转载 2017-08-08 09:33:38 · 112 阅读 · 0 评论 -
leetcode--Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the follo转载 2017-08-08 10:06:29 · 87 阅读 · 0 评论