码迷,mamicode.com
首页 >  
搜索关键字:maximum    ( 4142个结果
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...
分类:其他好文   时间:2014-08-26 22:44:46    阅读次数:212
[LeetCode] Longest Palindromic Substring
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...
分类:其他好文   时间:2014-08-26 19:09:06    阅读次数:153
LeetCode 54 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. Determine if yo...
分类:其他好文   时间:2014-08-26 17:33:46    阅读次数:200
Some Classical Recursive Functions
Some Classical Recursive FunctionsSome Classical Recursive FunctionsTable of Contents1. Find the maximum element of an array recursively.2. Recursivel...
分类:其他好文   时间:2014-08-26 11:14:05    阅读次数:170
URAL 1079 Maximum
天天有个好心情 1 import java.util.Scanner; 2 3 public class P1079 4 { 5 public static void main(String args[]) 6 { 7 int a[] = new int[10000...
分类:其他好文   时间:2014-08-26 02:52:35    阅读次数:203
LeetCode: Binary Tree Maximum Path Sum
LeetCode: Binary Tree Maximum Path SumGiven a binary tree, find the maximum path sum.The path may start and end at any node in the tree. For example:G...
分类:其他好文   时间:2014-08-25 22:34:54    阅读次数:184
【机器学习算法-python实现】最大似然估计(Maximum Likelihood)
1.背景           最大似然估计是概率论中常常涉及到的一种统计方法。大体的思想是,在知道概率密度f的前提下,我们进行一次采样,就可以根据f来计算这个采样实现的可能性。当然最大似然可以有很多变化,这里实现一种简单的,实际项目需要的时候可以再更改。       博主是参照wiki来学习的,地址请点击我           这里实现的是特别简单的例子如下(摘自wiki的最大似然)离散分布,离散...
分类:编程语言   时间:2014-08-25 11:53:54    阅读次数:1655
【Leet Code】Longest Palindromic Substring ——传说中的Manacher算法
Longest Palindromic Substring  Total Accepted: 17474 Total Submissions: 84472My Submissions Given a string S, find the longest palindromic substring in S. You may assume that the maximum l...
分类:其他好文   时间:2014-08-24 16:46:02    阅读次数:190
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-08-23 21:35:21    阅读次数:264
POJ 3693 Maximum repetition substring(后缀数组神题)
POJ 3693 Maximum repetition substring 题目链接 题意:给定一个字符串,求出其子串中,重复次数最多的串,如果有相同的,输出字典序最小的 思路:枚举长度l,把字符串按l分段,这样对于长度为l的字符串,肯定会包含一个分段位置,这样一来就可以在每个分段位置,往后做一次lcp,求出最大匹配长度,然后如果匹配长度有剩余,看剩余多少,就往前多少位置再做一次...
分类:其他好文   时间:2014-08-23 19:05:11    阅读次数:215
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!