数组
文章平均质量分 74
Lynn_Baby
这个作者很懒,什么都没留下…
展开
-
LeetCode—largest-rectangle-in-histogram(最大面积)—java
题目描述:Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.Above is a histogram where width ...原创 2018-08-09 23:32:06 · 368 阅读 · 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 · 793 阅读 · 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 · 735 阅读 · 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 · 252 阅读 · 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—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 · 981 阅读 · 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—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—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—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 · 1091 阅读 · 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 · 515 阅读 · 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 · 894 阅读 · 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 · 1394 阅读 · 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—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—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 · 767 阅读 · 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—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—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 · 451 阅读 · 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—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 · 1320 阅读 · 0 评论 -
LeetCode—search-insert-position(找到指定的值,否则是可能的位置)—java
题目描述: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...原创 2018-06-13 11:44:30 · 190 阅读 · 0 评论 -
LeetCode—trapping-rain-water(可以装多少水)—java
题目描述: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], ...原创 2018-06-21 08:54:53 · 758 阅读 · 0 评论 -
LeetCode—search-for-a-range(找一个值的范围)—java
题目描述: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 ofO(log n).If the target is not found in t...原创 2018-06-13 11:01:47 · 647 阅读 · 0 评论 -
LeetCode—search-in-rotated-sorted-array(旋转数组)—java
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 7might become4 5 6 7 0 1 2).You are given a ...原创 2018-06-12 14:27:19 · 443 阅读 · 0 评论 -
LeetCode—median-of-two-sorted-arrays(两个有序数组的中位数)—java
题目描述:There are two sorted arrays A and B 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的元素个数都大于k/2,我们比较A[...原创 2018-06-05 00:06:41 · 248 阅读 · 0 评论 -
LeetCode—two-sum—java
题目描述: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, wh...原创 2018-06-04 22:34:50 · 274 阅读 · 0 评论 -
剑指offer-数字在排序数组中的出现的次数-java
题目描述:统计一个数字在排序数组中出现的次数。思路解析:已经排好序的数组,肯定是二分法查找找到最前面的下标,找到最后的下标,就可以进行计算此方法是用非递归方法注意在做题时遇到了一个问题:java.lang.ArrayIndexOutOfBoundsException:-1,这是因为代码中的那两个顺序写反了代码:public class Solution { public int GetNu...原创 2018-04-24 15:06:59 · 189 阅读 · 0 评论 -
LeetCode—3sum(求和)—java
题目描述: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) must ...原创 2018-06-06 18:27:41 · 584 阅读 · 0 评论 -
LeetCode—3sum-closest(三个数的和最近的)—java
题目描述: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 ex...原创 2018-06-06 22:17:49 · 362 阅读 · 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 · 543 阅读 · 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—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 · 711 阅读 · 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—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—permutations_combinations_permutations-sequence(全排列——DFS深度优先搜索)—java
题目描述:Given a collection of 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], and[3,2,1].思路解析:https://blog.csdn.net/L...原创 2018-06-21 20:03:16 · 310 阅读 · 0 评论 -
LeetCode—jump-game-ii(跳跃数组的步长,返回最小步数)——java
题目描述:Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Your goal is t...原创 2018-06-21 17:17:08 · 2481 阅读 · 0 评论 -
LeetCode—jump-game(跳跃步数为数组给的值)—java
题目描述:Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine if y...原创 2018-06-21 16:15:04 · 724 阅读 · 0 评论