码迷,mamicode.com
首页 >  
搜索关键字:solution upgrade    ( 13024个结果
隐马尔可夫模型HMM与维特比Veterbi算法(二)
隐马尔可夫模型HMM与维特比Veterbi算法(二)主要内容:前向算法(Forward Algorithm)穷举搜索( Exhaustive search for solution)使用递归降低问题复杂度前向算法的定义程序实现前向算法举例说明前向算法一、前向算法(Forward Algorithm)...
分类:其他好文   时间:2014-05-18 19:05:07    阅读次数:389
LeetCode: Generate Parentheses [021]
【题目】 Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: "((()))", "(()())", "(())()", "()(())", "()()()" 【题意】 给定n对括号,输出所有可行的括号组合字符串。所谓合法,就是可以Valid Pare...
分类:其他好文   时间:2014-05-18 09:06:41    阅读次数:266
Machine learning with python - Linear Regression
Machine learning with python Linear Regression 数据来自 cs229 Problem Set 1 (pdf)Data:q1x.dat,q1y.dat,q2x.dat,q2y.datPS1 Solution (pdf)从左上往右下 batchG...
分类:编程语言   时间:2014-05-17 23:05:44    阅读次数:525
Java Concurrency In Practice -Chapter 2 Thread Safety
This post introduces the challenge and related solution (Atomic, Locks) on Thread Safety.
分类:编程语言   时间:2014-05-17 21:09:33    阅读次数:500
Leetcode | Recover Binary Search Tree
Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A solution using O(n) space is ...
分类:其他好文   时间:2014-05-17 14:45:17    阅读次数:290
LeetCode Scramble String
class Solution {public: bool isScramble(string s1, string s2) { int len = s1.length(); if (len == 1 && s1[0] == s2[0]) return true; ...
分类:其他好文   时间:2014-05-16 00:38:48    阅读次数:317
wordpress安装(ubuntu+nginx+php+mariadb)
一、环境ubuntu12.04.4nginx 1.6.0mariadb 10.0更新系统补丁sudo apt-get updatesudo apt-get dist-upgrade -y挂载swap分区dd if=/dev/zeroof=/media/fasthdd/swapfile.img bs=...
分类:数据库   时间:2014-05-15 17:23:21    阅读次数:1622
sgu 101 domino
题意还算简洁明了,加上有道翻译凑过着读完了题。题意大体上是 给你n个多米诺骨牌, 给出每个骨牌两端的数字, 只有数字相同才可以推到, 比如 2-3和3-2。你可以旋转这些多米诺骨牌, 输出一个可以全部推到的方案, 如果没有 ,输出 No solution。 第一眼看上去像爆搜, 但是 n 最大...
分类:其他好文   时间:2014-05-15 17:17:21    阅读次数:422
LeetCode Search in Rotated Sorted Array II
class Solution {public: bool search(int A[], int n, int target) { if (n A[mid]) { right = mid; sep = A[mid]; ...
分类:其他好文   时间:2014-05-15 09:29:52    阅读次数:177
LeetCode Gas Station
class Solution {public: int canCompleteCircuit(vector &gas, vector &cost) { int len = gas.size(); if (len diff(len, 0); for (...
分类:其他好文   时间:2014-05-15 01:58:39    阅读次数:358
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!