LeetCode
文章平均质量分 69
Lynn_Baby
这个作者很懒,什么都没留下…
展开
-
LeetCode—permutations-ii(有重复数字的排列)—java
题目描述:Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2]have the following unique permutations:[1,1,2],[1,2,1], and[2,1,1].思路解析:这个题...原创 2018-06-21 20:44:49 · 507 阅读 · 0 评论 -
LeetCode—generate-parentheses(所有括号的组合)—java
题目描述: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-06-07 20:06:38 · 807 阅读 · 0 评论 -
LeetCode—combination-sum(从给出的数组中组成目标数字)—java
题目描述: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 n...原创 2018-06-14 21:13:44 · 291 阅读 · 0 评论 -
LeetCode—combination-sum-ii(不能重复选取元素,来组成目标值)—java
题目描述:Given a collection of candidate numbers ( C ) and a target number ( T ), find all unique combinations in C where the candidate numbers sums to T .Each number in C may only be used once in the com...原创 2018-06-14 21:55:47 · 450 阅读 · 0 评论 -
LeetCode—reverse-nodes-in-k-group(k个一组反转链表)—java
题目描述: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 i...原创 2018-06-08 01:15:08 · 698 阅读 · 0 评论 -
LeetCode—remove-duplicates-from-sorted-array(有序数组中删除重复的元素)—java
题目描述:Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place wit...原创 2018-06-08 09:22:39 · 175 阅读 · 0 评论 -
LeetCode—remove-element(从数组中删除给出的元素)—java
题目描述: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.思路解析...原创 2018-06-08 09:43:09 · 405 阅读 · 0 评论 -
LeetCode—implement-strstr(找到字符串中的指定子串)—java
题目描述:Implement strStr().Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack.思路解析:遍历给出的haystack字符串,如果剩下的长度小于needle的长度,返回null如果找到一致的单字符,就循环遍历,直到遍历的...原创 2018-06-08 10:44:01 · 197 阅读 · 0 评论 -
LeetCode—divide-two-integers(分为两个整数)—java
题目描述:Divide two integers without using multiplication, division and mod operator.思路解析:判空,返回0使用long类型的变量存储division和divisor的绝对值如果除数小于被除数,返回0使用加法完成除法,注意保存加了多少倍,使用嵌套循环,外层控制division大于divisor,里层控制倍数增加一倍是否比d...原创 2018-06-08 15:55:29 · 969 阅读 · 0 评论 -
LeetCode—swap-nodes-in-pairs(成对结点的交换)—java
题目描述:Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->3.Your algorithm should use only consta...原创 2018-06-07 23:36:54 · 518 阅读 · 0 评论 -
LeetCode—merge-k-sorted-lists(归并排序链表)—java
题目描述:Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.思路解析:归并排序是排列数组的,现在应用到排列list这里来复习一下Merge Sort(对于数组操作),参考Wikipedia:归并操作(merge),也叫归并算法,指的是将两个已经排序的序列...原创 2018-06-07 21:25:23 · 486 阅读 · 0 评论 -
LeetCode—4sum(四个数求和)—java
题目描述:Given an array S of n integers, are there elements a, b, c, and d in Ssuch that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.Note:Elements in a q...原创 2018-06-07 10:55:16 · 504 阅读 · 0 评论 -
LeetCode—rotate-image(顺时针旋转90度)—java
题目描述: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?思路解析:旋转赋值交换就可以了代码:public class Solution { public void ro...原创 2018-06-21 21:33:51 · 710 阅读 · 0 评论 -
LeetCode—valid-sudoku(是不是满足数独条件)—java
题目描述: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 sudoku w...原创 2018-06-14 11:41:01 · 277 阅读 · 0 评论 -
LeetCode—letter-combinations-of-a-phone-number(手机数字键中字母组合)—java
题目描述: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 ...原创 2018-06-07 13:32:59 · 542 阅读 · 0 评论 -
LeetCode—remove-nth-node-from-end-of-list(删除链表倒数第n个结点)—java
题目描述:Given a linked list, remove the n th 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 ...原创 2018-06-07 14:04:02 · 160 阅读 · 0 评论 -
LeetCode—valid-parentheses(括号校验)—java
题目描述: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 but"(]"and...原创 2018-06-07 17:00:09 · 228 阅读 · 0 评论 -
LeetCode—sudoku-solver(数独的解法)—java
题目描述: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......a...原创 2018-06-14 16:16:55 · 1318 阅读 · 0 评论 -
LeetCode—count-and-say(计数并说出来)—java
题目描述:The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1is read off as"one 1"or11.11is read off as"two 1s"or21.21is read off as"one 2, thenone 1"o...原创 2018-06-14 17:30:47 · 499 阅读 · 0 评论 -
LeetCode—anagrams(返回由相同字母组成的单词)—java
题目描述:Given an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case.思路解析:首先判空然后需要创建HashMap来存储排序好的字符串,以及对应有相同字母组成的ArrayList。把每个字符串Arrays.sort以后,再以HashM...原创 2018-06-24 14:00:51 · 1053 阅读 · 0 评论 -
LeetCode—powx-n(x的n次)—java
题目描述:Implement pow(x, n).思路解析:pow(x,n)分解为pow(x,n/2)*pow(x,n/2) ,但是需要区分奇数偶数。还要看n的正负号。代码:public class Solution { public double pow(double x, int n) { if(n>=0) return power(x,n...原创 2018-06-24 14:22:25 · 238 阅读 · 0 评论 -
LeetCode—substring-with-concatenation-of-all-words(找给出子串数组组成的所有子串的位置)—java
题目描述:You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once and witho...原创 2018-06-10 17:49:54 · 306 阅读 · 0 评论 -
LeetCode—valid-number(正则表达式匹配)——java
题目描述:Validate if a given string is numeric.Some examples:"0"=>true" 0.1 "=>true"abc"=>false"1 a"=>false"2e10"=>trueNote: It is intended for the problem statement to be amb原创 2018-07-12 23:45:50 · 690 阅读 · 0 评论 -
LeetCode—plus-one&&sqrtx(加1&&开方)——java
题目描述:Given a number represented as an array of digits, plus one to the number.思路解析:计算加1后的数值高位在数组的开头,所以要从数组的最后开始检查每一位数字是不是小于9,如果是的话,直接加9就行了如果是小于9的就不用循环了,如果是大于9的就需要位数加1,需要加1然后判断高位是0,那么就表示进位了,就需要新建一个数组,向...原创 2018-07-13 00:37:54 · 255 阅读 · 0 评论 -
LeetCode—simplify-path(简化路径)—java
题目描述:Given an absolute path for a file (Unix-style), simplify it.For example,path ="/home/", =>"/home"path ="/a/./b/../../c/", =>"/c"click to show corner cases.Corner Cases:Did you consider the ...原创 2018-07-13 18:42:51 · 840 阅读 · 0 评论 -
LeetCode—permutation-sequence(全排列的第k个)—java
题目描述:The set[1,2,3,…,n]contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3):"123""132""213""231""312""321&qu原创 2018-07-08 00:05:32 · 766 阅读 · 0 评论 -
LeetCode—set-matrix-zeroes(矩阵置0)—java
题目描述:Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.click to show follow up.Follow up:Did you use extra space?A straight forward solution using O(m n) spa...原创 2018-07-13 23:03:54 · 342 阅读 · 0 评论 -
LeetCode—search-a-2d-matrix(排好序的矩阵中查找)—java
题目描述:Write an efficient algorithm that searches for a value in anm x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first integer of each row...原创 2018-07-13 23:48:44 · 370 阅读 · 0 评论 -
LeetCode—sort-colors(颜色012排序)—java
题目描述:Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers...原创 2018-07-14 00:18:26 · 1393 阅读 · 0 评论 -
LeetCode—subsets(子集dfs)—java
题目描述:Given a set of distinct integers, S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets.For example,If S =[1...原创 2018-07-15 00:13:04 · 893 阅读 · 0 评论 -
LeetCode—unique-paths_iiunique-paths_minimum-path-sum_climbing-stairs_edit-distance(动态规划)——java
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 ...原创 2018-07-12 19:06:01 · 229 阅读 · 0 评论 -
LeetCode—spiral-matrix-ii(螺旋赋值)—java
题目描述:Given an integer n, generate a square matrix filled with elements from 1 to n 2 in spiral order.For example,Given n =3,You should return the following matrix:[ [ 1, 2, 3 ], [ 8, 9, 4 ], [ 7, 6...原创 2018-07-06 00:14:22 · 254 阅读 · 0 评论 -
LeetCode—next-permutation(下一个排列)—java
题目描述: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 possibl...原创 2018-06-10 23:03:49 · 979 阅读 · 0 评论 -
LeetCode—n-queens(n皇后问题)—java
题目描述:The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to the n-queens puzzle.Each...原创 2018-06-28 18:05:28 · 984 阅读 · 0 评论 -
LeetCode—n-queens-ii(返回解决方案的总数)—java
题目描述:Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.思路解析:跟第一个题一样的解决方法,但是需要注意的是这个是计数,计数的话要用数组,因为数组就会更新里面的值。如果行数等于总行数,就可以在解决方案...原创 2018-06-28 19:19:04 · 251 阅读 · 0 评论 -
LeetCode—maximum-subarray(最大子数组的和)—java
题目描述:Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[−2,1,−3,4,−1,2,1,−5,4],the contiguous subarray[4,−1,2,1]has th...原创 2018-06-28 22:01:54 · 733 阅读 · 0 评论 -
LeetCode—spiral-matrix(螺旋矩阵)—java
题目描述:Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ]]You sho...原创 2018-07-05 00:28:11 · 792 阅读 · 0 评论 -
LeetCode—merge-intervals(合并重叠的间隔)—java
题目描述: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].思路解析:题意:将重叠的数组合并起来我们首先要做的就是给区间集排序,由于我们要排序的是个结构体,所以我们要定义自己的c...原创 2018-07-05 01:17:17 · 1090 阅读 · 0 评论 -
LeetCode—insert-interval(插入间隔)—java
题目描述:Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted according to their start times.Exam...原创 2018-07-05 23:39:40 · 512 阅读 · 0 评论 -
LeetCode—length-of-last-word(最后一个单词的长度)—java
题目描述:Given a string s consists of upper/lower-case alphabets and empty space characters' ', return the length of last word in the string.If the last word does not exist, return 0.Note: A word is defin...原创 2018-07-05 23:52:52 · 1094 阅读 · 0 评论