leetcode
文章平均质量分 71
Nixum丶丶
正在学习中
展开
-
leetcode 46. Permutations(考全排列)
Given a collection of distinct numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1原创 2017-04-10 00:26:23 · 640 阅读 · 0 评论 -
62. Unique Paths
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the bott...原创 2018-04-25 17:20:43 · 228 阅读 · 0 评论 -
78. Subsets
Given a set of distinct integers, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.Example:Input: nums = [1,2,3]Output:[ [3], [1], [2...原创 2018-04-25 17:11:41 · 220 阅读 · 0 评论 -
56. Merge Intervals
Given a collection of intervals, merge all overlapping intervals.For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15,18].题目:给定的间隔中,如果有 重叠的,就组合在一起,大概意思看例子应该就能懂了思路:一开始的想法是先根据end,进行由小到大的...原创 2018-04-04 11:56:56 · 247 阅读 · 0 评论 -
49. Group Anagrams
Given an array of strings, group anagrams together.For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return:[ ["ate", "eat","tea"], ["nat"原创 2018-04-03 20:02:20 · 170 阅读 · 0 评论 -
86. Partition List
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in each of the...原创 2018-04-03 00:48:49 · 130 阅读 · 0 评论 -
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). Find two ...原创 2018-03-21 17:07:28 · 156 阅读 · 0 评论 -
34.Search for a Range
Given an array of integers sorted in ascending order, 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 i...原创 2018-03-21 11:56:16 · 122 阅读 · 0 评论 -
27. Remove Element
Given an array and a value, remove all instances of that value in-place and return the new length.Do not allocate extra space for another array, you must do this by modifying the input array in-place ...原创 2018-03-13 21:51:55 · 132 阅读 · 0 评论 -
14. Longest Common Prefi
Write a function to find the longest common prefix string amongst an array of strings。给定一个字符串数组,找出数组内所有字符串共同的字符串前缀题比较简单,直接上代码public String longestCommonPrefix(String[] strs) { if(strs != null) ...原创 2018-03-13 21:47:32 · 171 阅读 · 0 评论 -
22. 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:[ "((()))", "(()())", "(())()", "()(())", "...原创 2018-03-15 00:03:39 · 133 阅读 · 0 评论 -
leetcode 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: The solution set must not contain dupli...原创 2018-03-07 16:29:38 · 150 阅读 · 0 评论 -
leetcode 48. Rotate Image(矩阵旋转)
You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?将矩阵顺时针旋转90度。思路:先在纸上画一个3x3的矩阵,在画出它旋转90度之后的图形,观察其变化----------------...原创 2017-04-20 00:46:40 · 291 阅读 · 0 评论 -
leetcode 12.IntegertoRoman(整形转罗马数字)
Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.将给定的数字转换为罗马数字,范围为(1~3999)罗马数字的组成规则自己网上找思路:观察可得罗马数字(1~3999)的组成分为4种类型,原创 2017-04-13 22:13:35 · 309 阅读 · 0 评论 -
leetcode 535. Encode and Decode TinyURL(长短网址互译)
TinyURL is a URL shortening service where you enter a URL such as https://leetcode.com/problems/design-tinyurl and it returns a short URL such as http://tinyurl.com/4e9iAk.Design the encode and原创 2017-04-13 00:38:11 · 2445 阅读 · 0 评论 -
64. Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at any...原创 2018-04-25 17:25:55 · 196 阅读 · 0 评论