Math
文章平均质量分 53
FrancisGeek的工作室
算法&设计模式
展开
-
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 评论 -
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 评论 -
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 评论 -
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 评论 -
买卖股票问题总结
Description:Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (ie, buy one and sell one share of th原创 2016-12-09 19:48:10 · 244 阅读 · 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 评论 -
Search a 2D Matrix II
Description:Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted in ascending from left to right. Integer原创 2017-03-08 21:24:37 · 162 阅读 · 0 评论