![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
文章平均质量分 71
Ines_Yim
这个作者很懒,什么都没留下…
展开
-
[LeetCode]--Reverse Integer
题目 Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 Note: The input is assumed to be a 32-bit signed integer. Your function should原创 2017-09-27 10:46:21 · 153 阅读 · 0 评论 -
[LeetCode]--Maximum Product Subarry
题目Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has the largest prod原创 2018-01-19 09:54:26 · 273 阅读 · 0 评论 -
[LeetCode]--Unique Paths II
题目Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively原创 2018-01-08 09:08:57 · 130 阅读 · 0 评论 -
[LeetCode]--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 reac原创 2018-01-07 22:14:38 · 172 阅读 · 0 评论 -
[LeetCode]--Search a 2D Matrix II
题目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.Inte原创 2018-01-21 22:37:00 · 140 阅读 · 0 评论 -
[LeetCode]--Monotone Increasing Digits
题目Given a non-negative integer N, find the largest number that is less than or equal to N with monotone increasing digits.(Recall that an integer has monotone increasing digits if and only原创 2018-01-21 11:40:43 · 192 阅读 · 0 评论 -
[LeetCode]--Balanced Binary Tree
题目Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node nev原创 2018-01-21 09:44:44 · 142 阅读 · 0 评论 -
[LeetCode]--House Robber
题目You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjace原创 2018-01-03 10:54:31 · 187 阅读 · 0 评论 -
[LeetCode]--Best Time to Buy and Sell Stock
题目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 the原创 2018-01-03 10:03:23 · 173 阅读 · 0 评论 -
[LeetCode]--Climbing Stairs
题目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?Note: Given n will b原创 2018-01-03 08:50:15 · 135 阅读 · 0 评论 -
[LeetCode]--Symmetric Tree
题目 Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ /原创 2017-12-20 14:27:40 · 132 阅读 · 0 评论 -
[LeetCode]--Maximum Subarray
题目 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 conti原创 2017-11-10 10:09:41 · 125 阅读 · 0 评论 -
[LeetCode]--Merge k Sorted Lists
题目 Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 中文题意:归并排序 k 个有序列表并返回结果,分析其复杂度。分析 根据分治策略,我们可以将 k 个有序列表原创 2017-11-10 08:27:38 · 134 阅读 · 0 评论 -
[LeetCode]--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)原创 2017-10-18 15:01:55 · 142 阅读 · 0 评论 -
[LeetCode]--Add Two Numbers
题目 You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two原创 2017-09-19 17:45:12 · 339 阅读 · 0 评论 -
[Leetcode]--Coin Change
题目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 amount of mone原创 2018-01-19 10:41:40 · 196 阅读 · 0 评论