码迷,mamicode.com
首页 >  
搜索关键字:maximum likelihood    ( 4167个结果
leetcode 5.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...
分类:其他好文   时间:2015-01-06 23:07:00    阅读次数:208
[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 binary tree, 1 / \ 2 3...
分类:其他好文   时间:2015-01-06 17:38:16    阅读次数:199
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 complete at most two transactions. Note: You may ...
分类:其他好文   时间:2015-01-06 15:41:54    阅读次数:189
windows下Socket链接溢出
最近在windows下使用通过多线程使用jdbc操作数据库,在线程数设置为5,并且每个线程执行完成后Sleep(1000),在这种情况下,竟然还会报错:java.net.SocketException No buffer space available (maximum connections re...
分类:Windows程序   时间:2015-01-06 15:29:04    阅读次数:251
[LeetCode]104 Maximum Depth of Binary Tree
https://oj.leetcode.com/problems/maximum-depth-of-binary-tree/http://blog.csdn.net/linhuanmars/article/details/19659525/** *Definitionforbinarytree *publicclassTreeNode{ *intval; *TreeNodeleft; *TreeNoderight; *TreeNode(intx){val=x;} *} */ publicclassSoluti..
分类:其他好文   时间:2015-01-06 12:08:50    阅读次数:184
手机端的meta信息
一:meta信息(1) width-viewport的宽度height-viewport的高度 initial-scale-初始的缩放比例 minimum-scale-允许用户缩放到的最小比例 maximum-scale-允许用户缩放到的最大比例 user-scalable-用户是否可以手...
分类:移动开发   时间:2015-01-06 11:23:51    阅读次数:149
【leetcode】Maximum Subarray
Maximum SubarrayFind the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[?...
分类:其他好文   时间:2015-01-05 21:49:59    阅读次数:240
LeetCode:Jump Game
题目描述: 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. ...
分类:其他好文   时间:2015-01-05 11:13:23    阅读次数:174
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 complete at most two transactions. Note: You may ...
分类:其他好文   时间:2015-01-04 17:14:20    阅读次数:130
[LeetCode]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], the contiguous subarray [2,3] has the largest ...
分类:其他好文   时间:2015-01-04 17:13:57    阅读次数:158
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!