数组
文章平均质量分 55
FrancisGeek的工作室
算法&设计模式
展开
-
Remove Element
Description: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 in place with constant me原创 2016-12-07 22:33:59 · 190 阅读 · 0 评论 -
Merge Sorted Array
Description:Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note: You may assume that nums1 has enough space (size that is greater or equal to m + n) to h原创 2016-12-07 22:44:59 · 134 阅读 · 0 评论 -
Coin Change
Description:You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amoun原创 2017-01-08 21:42:49 · 176 阅读 · 0 评论 -
Unique Paths
Description: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 r原创 2016-12-31 12:56:38 · 194 阅读 · 0 评论 -
Maximum Subarray
Description:Find the contiguous subarray within an array (containing at least one number) which has the largest sum.public int maxSubArray(int[] nums){}问题描述:给一给数组,找到这个数组的子数组(子数组连续),这个子数组是所有子数组中元素的和最大的,原创 2016-12-31 11:34:18 · 223 阅读 · 2 评论 -
Maximal Square
Description:Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area.问题描述:给一个2-D数组,数组中的元素全为1或者0,在找这个矩阵中找到最大额一块正方形区域,这块正方形区域所满足的条件是里面的元素全为1,然后返回这原创 2017-01-05 20:32:19 · 190 阅读 · 0 评论 -
Decode Ways
Description:A message containing letters from A-Z is being encoded to numbers using the following mapping:‘A—>1 ‘B’—>2 ….. ‘Z’—->26 Given an encoded message containing digits, determine the total n原创 2017-01-04 21:02:48 · 530 阅读 · 2 评论 -
Climbing Stairs
Description:you are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?问题描述:爬楼梯问题,楼梯总共有n级台阶,你可原创 2016-12-27 19:41:17 · 185 阅读 · 0 评论 -
Contains Duplicate
Description:Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every原创 2016-12-27 18:31:26 · 135 阅读 · 0 评论 -
Rotate Array
DescriptionRotate an array of n elements to the right by k steps. Could you do it in-place with O(1) extra space?问题描述将一个数组向右旋转k步,这个题目和之前的旋转链表类似,但是这次处理的是数组,所以方法还是不同的。Ex:旋转操作比较抽象,用例子说明 For example, wit原创 2016-12-27 17:20:20 · 213 阅读 · 0 评论 -
Majority Element
Description:Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times You may assume that the array is non-empty and the majority el原创 2016-12-27 17:05:39 · 185 阅读 · 0 评论 -
Minimum Path Sum
Description: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原创 2017-01-02 21:49:39 · 188 阅读 · 0 评论 -
Pascal's Triangle II
Description:Given an index k, return the kth row of the Pascal’s triangle. Note Could you optimize your algorithm to use only O(k) extra space?问题描述:给一个索引k,返回第k层的杨辉三角,注意第0层为[1]Ex:given k = 3 Return [原创 2016-12-09 19:25:34 · 198 阅读 · 0 评论 -
Pascal's Triangle
Description:Given numRows, generate the first numRows of Pascal’s triangle.问题描述:Pascal三角也被称为杨辉三角,杨辉三角的本质是二项式的展开系数。给定一个层值,返回前层值的杨辉三角。Ex:given numRows = 5 Return[ [1], [1,1], [1,2,1],原创 2016-12-09 19:04:35 · 148 阅读 · 0 评论 -
Plus One
Description:Given a non-negative number represented as an array of digits, plus one to the number. he digits are stored such that the most significant digit is at the head of the list.问题描述:给一个数组表示的非负数原创 2016-12-07 22:54:30 · 205 阅读 · 0 评论 -
Remove Duplicates from Sorted Array
Description: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 p原创 2016-12-06 23:03:19 · 167 阅读 · 0 评论