leetcode题解
文章平均质量分 75
CAJET1996
SYSU——2014
展开
-
[leetcode] 第二周作业
题目来源: 53. 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,原创 2017-09-18 09:40:47 · 358 阅读 · 0 评论 -
[leetcode]第17周作业
解:我们可以把最大独立集问题规约到最大公共子图问题。对于任意的图 G(V, E),我们要求它的大小为b的独立集(即最大独立集), 我们可以令G1= G(V, E), G2= G(V, ),我们要求G 的最大独立集,可以转化为从G(V, E)中删除最少的顶点,使得余下的顶点 V' 相互独立, 即最后的图 为 G‘(V‘, ),也就是G1,G2存在大小为b的最大公共子图。因此,于是G1,G2存原创 2017-12-30 11:47:35 · 295 阅读 · 0 评论 -
[leetcode]第15周作业
题目: 547. Friend CirclesThere are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a direct friend of B, and B is a dir原创 2017-12-17 10:43:31 · 232 阅读 · 0 评论 -
[leetcode] 第16周作业
题目:654. Maximum Binary TreeGiven an integer array with no duplicates. A maximum tree building on this array is defined as follow:1.The root is the maximum number in the array. 2.The left subtree is th原创 2017-12-24 09:50:39 · 250 阅读 · 0 评论 -
[leetcode]第12周作业
问题:452. Minimum Number of Arrows to Burst BalloonsThere are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the hori原创 2017-11-26 09:51:08 · 183 阅读 · 0 评论 -
[leetcode]第13周作业
题目:525. Contiguous Array Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1.Example 1: Input: [0,1] Output: 2 Explanation: [0, 1] is the longe原创 2017-12-02 16:50:35 · 155 阅读 · 0 评论 -
[leetcode]第14周作业
题目:152. Maximum Product SubarrayFind 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 su原创 2017-12-09 15:33:20 · 180 阅读 · 0 评论 -
[leetcode]第11周作业
题目:62. 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 tryin原创 2017-11-19 14:25:53 · 158 阅读 · 0 评论 -
[leetcode]第七周作业
题目:134. Gas StationThere are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from s原创 2017-10-22 11:15:43 · 499 阅读 · 0 评论 -
[leetcode]第八周作业
题目来源: < leetcode > 400. Nth Digit题目: Find the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, …Note: n is positive and will fit within the range of a 32-bit signed int原创 2017-10-30 11:46:14 · 282 阅读 · 0 评论 -
[leetcode]第十周作业
题目:< leetcode > 300. Longest Increasing SubsequenceGiven an unsorted array of integers, find the length of longest increasing subsequence.For example, Given [10, 9, 2, 5, 3, 7, 101, 18], The longest原创 2017-11-11 09:38:39 · 215 阅读 · 0 评论 -
[leetcode]第九周作业
题目来源: < leetcode > 343 . Integer BreakGiven a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you ca原创 2017-11-04 22:53:48 · 194 阅读 · 0 评论 -
[leetcode] 第六周作业
题目一453.Minimum Moves to Equal Array ElementsGiven a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 ele原创 2017-10-13 13:08:16 · 180 阅读 · 0 评论 -
[leetcode] 第五周作业
题目来源:8. String to Integer (atoi)题目:Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself原创 2017-10-09 20:44:09 · 153 阅读 · 0 评论 -
[leetcode] 第一周作业
题目来源: 14. Longest Common Prefix题目 Write a function to find the longest common prefix string amongst an array of strings.分析: 比较直白的思路: 初始化公共前缀就是第一个字符串,然后和后面的每一个字符串比较,寻找与公共前缀中相等的前缀长度代码:class Solution {原创 2017-09-21 13:33:41 · 187 阅读 · 0 评论 -
[leetcode] 第三周作业
题目来源: 215. Kth Largest Element in an Array题目: Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For example,原创 2017-09-21 13:43:54 · 448 阅读 · 0 评论 -
[leetcode] 第四周作业
题目来源: 53.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 contiguo原创 2017-09-27 10:40:12 · 194 阅读 · 0 评论 -
[leetcode]第18周作业
题目:120. TriangleGiven a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[原创 2018-01-07 10:32:35 · 306 阅读 · 0 评论