码迷,mamicode.com
首页 >  
搜索关键字:maximum repetition s    ( 4177个结果
IP分片浅析
在TCP/IP分层中,数据链路层用MTU(Maximum Transmission Unit,最大传输单元)来限制所能传输的数据包大小,MTU是指一次传送的数据最大长度,不包括数据链路层数据帧的帧头,如以太网的MTU为1500字节,实际上数据帧的最大长度为1512字节,其中以太网数据帧的帧头为12字...
分类:其他好文   时间:2015-07-15 12:30:43    阅读次数:115
[LeetCode] Maximum Depth of Binary Tree
Question:Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the fa...
分类:其他好文   时间:2015-07-14 17:15:29    阅读次数:106
[LeetCode][Java] Jump Game II
题目: 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. Yo...
分类:编程语言   时间:2015-07-14 11:26:06    阅读次数:140
5.Longest Palindromic Substring (String; DP)
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longes...
分类:其他好文   时间:2015-07-14 09:48:50    阅读次数:130
Leetcode 53 Maximum SubArray
---恢复内容开始---方法1:brute force 时间复杂度 O(n^2) 空间复杂度 O(1)public class Solution { public int maxSubArray(int[] nums) { if (nums == null || nums.length ...
分类:其他好文   时间:2015-07-14 07:31:45    阅读次数:94
Maximum Product Subarray
题目: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],...
分类:其他好文   时间:2015-07-13 22:22:20    阅读次数:95
*Best Time to Buy and Sell Stock III
题目:Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complet...
分类:其他好文   时间:2015-07-13 22:12:40    阅读次数:102
Maximum Sum 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...
分类:其他好文   时间:2015-07-13 22:02:02    阅读次数:142
[LeetCode] Maximum Gap
Given an unsorted array, find the maximum difference between the successive elements in its sorted form.Try to solve it in linear time/space.Return 0 ...
分类:其他好文   时间:2015-07-13 20:13:08    阅读次数:126
Maximum Subarray
https://leetcode.com/problems/maximum-subarray/动态规划:用res数组来记录包含了每个点的连续数组的和的最大的情况解的情况,后续的每次计算参考前面的计算结果。 1 class Solution { 2 public: 3 int maxSubAr...
分类:其他好文   时间:2015-07-13 17:34:41    阅读次数:89
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!