码迷,mamicode.com
首页 >  
搜索关键字:maximum    ( 4142个结果
用json2.js 代替 json.js防止与jQuery的js冲突
用json2.js 代替 json.js防止与jQuery的js冲突 1 s.toJSONString json.js:259 2 Object.toJSONString json.js:158 3 Uncaught RangeError: Maximum call stack siz...
分类:Web程序   时间:2014-10-08 17:49:25    阅读次数:270
修改Eclipse格式化代默认长度
eclipse 默认设置的换行长度, 格式化代码后,经常换行,非常难看。1.Java代码打开Eclipse的Window菜单,然后Preferences->Java->Code Style->Formatter->Edit -> New ...->Line Wrapping->Maximum lin...
分类:系统相关   时间:2014-10-08 14:04:55    阅读次数:178
[LeetCode] Max Points on a Line
Givennpoints on a 2D plane, find the maximum number of points that lie on the same straight line. 1 #include 2 #include 3 #include 4 #include 5 #i...
分类:其他好文   时间:2014-10-07 16:09:53    阅读次数:188
UVa 11059 - Maximum Product
题目:最大字段积。 分析:dp,最大字段和类似物。求解过程同最大字段和。             这里注意,设置两个状态:以本元素结束时,最大正值和最小的负值。             更新时,如果data[i]为正,则对应跟新,如果data[i]为负,则交叉跟新,             data[i]为0时,当前最大值,最小值置零。             本体数据较小,可以直接用O...
分类:其他好文   时间:2014-10-07 14:55:53    阅读次数:219
leetcode -- Binary Tree Maximum Path Sum
过去只是人生经历,并不是人生负担[问题描述]Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below bi...
分类:其他好文   时间:2014-10-07 13:47:03    阅读次数:195
hdu 3455 Leap Frog(状压DP)
Problem Description Jack and Jill play a game called "Leap Frog" in which they alternate turns jumping over each other. Both Jack and Jill can jump a maximum horizontal distance of 10 units in any ...
分类:其他好文   时间:2014-10-07 13:34:33    阅读次数:152
Leetcode Best Time to Buy and Sell Stock II
/** * Say you have an array for which the ith element is the price of a given stock on day i. * Design an algorithm to find the maximum profit. You may complete as many transactions as you like * ...
分类:其他好文   时间:2014-10-07 11:10:03    阅读次数:129
【Leetcode】Longest Palindromic Substring
Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa...
分类:其他好文   时间:2014-10-07 00:32:12    阅读次数:237
leetcode - Maximum Depth of Binary Tree
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 farthest leaf node. /** * Definition for binary tree ...
分类:其他好文   时间:2014-10-06 16:08:40    阅读次数:181
Leetcode: Best Time to Buy and Sell Stock III
Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complet...
分类:其他好文   时间:2014-10-06 14:52:50    阅读次数:220
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!