<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[jeiwt的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/jeiwt</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; jeiwt]]></copyright><item><title><![CDATA[Uber link test]]></title><link>https://blog.youkuaiyun.com/jeiwt/article/details/49277485</link><guid>https://blog.youkuaiyun.com/jeiwt/article/details/49277485</guid><author>jeiwt</author><pubDate>Tue, 20 Oct 2015 15:04:27 +0800</pubDate><description><![CDATA[Head

My Uber Profile]]></description><category></category></item><item><title><![CDATA[RMP （Range Minimum Query）问题]]></title><link>https://blog.youkuaiyun.com/jeiwt/article/details/38620215</link><guid>https://blog.youkuaiyun.com/jeiwt/article/details/38620215</guid><author>jeiwt</author><pubDate>Sat, 16 Aug 2014 22:06:01 +0800</pubDate><description><![CDATA[﻿﻿
问题描述
RMQ问题是求给定区间中的最值问题。对于长度为n的数列A，回答若干查询RMQ(A, i, j)。返回数组A中下标在[i，j]里的最小值的下标。比如数列 5,8,1,3,6,4,9,5,7      那么RMQ(2,4) = 3， RMQ(6,9)
 = 6.


解决问题
最简单的解法时间复杂度是O（n），就是对于每一个查询遍历一遍数组。但是当n非常大的时候，并且查询]]></description><category></category></item><item><title><![CDATA[KMP算法]]></title><link>https://blog.youkuaiyun.com/jeiwt/article/details/38478295</link><guid>https://blog.youkuaiyun.com/jeiwt/article/details/38478295</guid><author>jeiwt</author><pubDate>Mon, 11 Aug 2014 00:00:07 +0800</pubDate><description><![CDATA[原帖
http://blog.youkuaiyun.com/v_july_v/article/details/7041827#comments]]></description><category></category></item><item><title><![CDATA[const 全面总结]]></title><link>https://blog.youkuaiyun.com/jeiwt/article/details/38478113</link><guid>https://blog.youkuaiyun.com/jeiwt/article/details/38478113</guid><author>jeiwt</author><pubDate>Sun, 10 Aug 2014 23:51:11 +0800</pubDate><description><![CDATA[原帖
http://blog.youkuaiyun.com/Eric_Jo/article/details/4138548




﻿﻿]]></description><category></category></item><item><title><![CDATA[编程之美 4.2 瓷砖覆盖地板 扩展问题]]></title><link>https://blog.youkuaiyun.com/jeiwt/article/details/38459105</link><guid>https://blog.youkuaiyun.com/jeiwt/article/details/38459105</guid><author>jeiwt</author><pubDate>Sat, 09 Aug 2014 19:08:04 +0800</pubDate><description><![CDATA[原帖
http://blog.youkuaiyun.com/limchiang/article/details/8619611




题意：用 1 * 2 的瓷砖覆盖 n * m 的地板，问共有多少种覆盖方式？ 
思路：用2进制的01表示不放还是放，第i行只和i-1行有关，枚举i-1行的每个状态，推出由此状态能达到的i行状态：如果i-1行的出发状态某处未放，必然要在i行放一个竖的方块，所以我对]]></description><category></category></item><item><title><![CDATA[状态压缩DP]]></title><link>https://blog.youkuaiyun.com/jeiwt/article/details/38459073</link><guid>https://blog.youkuaiyun.com/jeiwt/article/details/38459073</guid><author>jeiwt</author><pubDate>Sat, 09 Aug 2014 18:58:30 +0800</pubDate><description><![CDATA[原帖
http://blog.youkuaiyun.com/lmyclever/article/details/6671923




我们知道，用DP解决一个问题的时候很重要的一环就是状态的表示，一般来说，一个数组即可保存状态。但是有这样的一些题目，它们具有DP问题的特性，但是状态中所包含的信息过多，如果要用数组来保存状态的话需要四维以上的数组。于是，我们就需要通过状态压缩来保存状态，而使用状态]]></description><category></category></item><item><title><![CDATA[有重复元素的全排列问题]]></title><link>https://blog.youkuaiyun.com/jeiwt/article/details/38307833</link><guid>https://blog.youkuaiyun.com/jeiwt/article/details/38307833</guid><author>jeiwt</author><pubDate>Wed, 30 Jul 2014 22:34:08 +0800</pubDate><description><![CDATA[有重复元素的全 列问题]]></description><category></category></item><item><title><![CDATA[6天通吃树结构]]></title><link>https://blog.youkuaiyun.com/jeiwt/article/details/38238657</link><guid>https://blog.youkuaiyun.com/jeiwt/article/details/38238657</guid><author>jeiwt</author><pubDate>Mon, 28 Jul 2014 22:53:30 +0800</pubDate><description><![CDATA[﻿﻿
第一天 儿茶
http://www.cnblogs.com/huangxincheng/archive/2012/07/21/2602375.html]]></description><category></category></item><item><title><![CDATA[背包问题]]></title><link>https://blog.youkuaiyun.com/jeiwt/article/details/38238623</link><guid>https://blog.youkuaiyun.com/jeiwt/article/details/38238623</guid><author>jeiwt</author><pubDate>Mon, 28 Jul 2014 22:47:33 +0800</pubDate><description><![CDATA[背包问题详解]]></description><category></category></item><item><title><![CDATA[归并排序(二分) 应用]]></title><link>https://blog.youkuaiyun.com/jeiwt/article/details/38096193</link><guid>https://blog.youkuaiyun.com/jeiwt/article/details/38096193</guid><author>jeiwt</author><pubDate>Thu, 24 Jul 2014 22:56:31 +0800</pubDate><description><![CDATA[原文 见 
http://blog.youkuaiyun.com/mitedu/article/details/3882343]]></description><category></category></item><item><title><![CDATA[排序二叉树]]></title><link>https://blog.youkuaiyun.com/jeiwt/article/details/38061633</link><guid>https://blog.youkuaiyun.com/jeiwt/article/details/38061633</guid><author>jeiwt</author><pubDate>Wed, 23 Jul 2014 11:56:06 +0800</pubDate><description><![CDATA[http://www.cnblogs.com/timeship/archive/2012/08/03/2622293.html
 
二叉排序数的（递归）定义：1、若左子树非空，则左子树所有节点的值均小于它的根节点；2、若右子树非空，则右子树所有节点的值均大于于它的根节点；3、左右子树也分别为二叉排序树。
如图：]]></description><category></category></item><item><title><![CDATA[算法导论 概率 投球问题 5.4-6]]></title><link>https://blog.youkuaiyun.com/jeiwt/article/details/37578613</link><guid>https://blog.youkuaiyun.com/jeiwt/article/details/37578613</guid><author>jeiwt</author><pubDate>Tue, 08 Jul 2014 22:47:35 +0800</pubDate><description><![CDATA[﻿﻿
题目：
假设将n个球投入n个盒子里，每次投球都是独立的，并且每个球落入任何盒子的机会都相等。空盒子的期望数量是多少？正好有一个球的盒子的期望数量又是多少？]]></description><category></category></item><item><title><![CDATA[算法导论 概率 投球问题 5.4-2]]></title><link>https://blog.youkuaiyun.com/jeiwt/article/details/37576971</link><guid>https://blog.youkuaiyun.com/jeiwt/article/details/37576971</guid><author>jeiwt</author><pubDate>Tue, 08 Jul 2014 22:21:06 +0800</pubDate><description><![CDATA[﻿﻿
 假设将球投入到b个盒子里。每一次投掷都是独立的，并且每个球落入任何盒子的机会都相等。在至少有一个盒子包含两个球之前，期望的投球次数是多少？]]></description><category></category></item><item><title><![CDATA[深度学习(Deep Learning)综述及算法简介]]></title><link>https://blog.youkuaiyun.com/jeiwt/article/details/30805435</link><guid>https://blog.youkuaiyun.com/jeiwt/article/details/30805435</guid><author>jeiwt</author><pubDate>Sat, 14 Jun 2014 21:41:33 +0800</pubDate><description><![CDATA[﻿﻿
深度学习(Deep Learning)综述及算法简介 
作者： 张梓琪.CAS



 
前言：本文翻译自deeplearning网站，主要综述了一些论文、算法已经工具箱。
 
引言：神经网络（Neural Network）与支持向量机（Support
Vector Machines，SVM）是统计学习的代表方法。可以认为神经网络与支持向量机都源自于感知机（Percept]]></description><category></category></item><item><title><![CDATA[JavaScript 写在head, body的区别]]></title><link>https://blog.youkuaiyun.com/jeiwt/article/details/8236422</link><guid>https://blog.youkuaiyun.com/jeiwt/article/details/8236422</guid><author>jeiwt</author><pubDate>Wed, 28 Nov 2012 22:00:09 +0800</pubDate><description><![CDATA[一般来说，放在里的会比放在先执行。在head标签里的代码会在页面还未开始绘制之前解析并执行，在body里的代码则会在页面渲染的同时在读取到这段代码的时候就被执行了。
  
  
alert('我是head中的代码片段：\n'  
+'i1引用:'+document.getElementById('i1')  
+"\ni2引用:"+document.getElementById('i2')]]></description><category></category></item><item><title><![CDATA[维特比算法(Viterbi Algorithm)]]></title><link>https://blog.youkuaiyun.com/jeiwt/article/details/8076739</link><guid>https://blog.youkuaiyun.com/jeiwt/article/details/8076739</guid><author>jeiwt</author><pubDate>Tue, 16 Oct 2012 13:44:22 +0800</pubDate><description><![CDATA[寻找最可能的隐藏状态序列 (Finding most probable sequence of hidden states)

对于一个特殊的隐马尔科夫模型(HMM)及一个相应的观察序列，我们常常希望能找到生成此序列最可能的隐藏状态序列。
之前的那个问题变转，http://blog.youkuaiyun.com/jeiwt/article/details/8076019
 

假设连续观察3天的海]]></description><category></category></item><item><title><![CDATA[前向算法(Forward Algorithm)]]></title><link>https://blog.youkuaiyun.com/jeiwt/article/details/8076019</link><guid>https://blog.youkuaiyun.com/jeiwt/article/details/8076019</guid><author>jeiwt</author><pubDate>Tue, 16 Oct 2012 10:39:48 +0800</pubDate><description><![CDATA[本文直接举实例说明ForwardAlgorithm (前向算法)
由马尔科夫模型MM可知:对于一个系统，由一个状态转至另一个状态的转换过程中，存在着转移概率，并且这种转移概率可以依据其紧接的前一种状态推算出来，与该系统的原始状态和此次转移前的马尔可夫过程无关。
隐马尔可夫模型（HiddenMarkov models，HMM）是马尔可夫链的一种，它的状态不能直接观察到，但能通过观测向量序列观察到]]></description><category></category></item><item><title><![CDATA[二叉树 转成 左孩子右兄弟树]]></title><link>https://blog.youkuaiyun.com/jeiwt/article/details/8059888</link><guid>https://blog.youkuaiyun.com/jeiwt/article/details/8059888</guid><author>jeiwt</author><pubDate>Thu, 11 Oct 2012 12:41:43 +0800</pubDate><description><![CDATA[Tree从底往上，指针倒换
故用到stack，深度优先DFS
               A 
        B            C
   D       E     F    G
转换成
                  A 
            B            
     D            C
         E     F]]></description><category></category></item><item><title><![CDATA[N个鸡蛋放M个篮子，每个篮子不空，保证提不同组合的篮子能取出1至N个鸡蛋]]></title><link>https://blog.youkuaiyun.com/jeiwt/article/details/8054291</link><guid>https://blog.youkuaiyun.com/jeiwt/article/details/8054291</guid><author>jeiwt</author><pubDate>Tue, 09 Oct 2012 22:50:27 +0800</pubDate><description><![CDATA[N个鸡蛋放M个篮子，每个篮子不空，保证提不同组合的篮子能取出1至N个鸡蛋。输出所有可能的放法。
 
例如6个鸡蛋放入3个篮子，则1,2,3能满足条件。
如8个鸡蛋放入4个篮子，则1,1,2,4能满足条件，1,2,2,3也能满足条件。
 
深度优先方法解答。假设按顺序篮子里的鸡蛋个数是呈现递增。
如第一个肯定是1，第二个篮子呢，只能是1或者2；
如果第二个篮子是1，则第三个篮子可以是1]]></description><category></category></item><item><title><![CDATA[最长回文数]]></title><link>https://blog.youkuaiyun.com/jeiwt/article/details/7979416</link><guid>https://blog.youkuaiyun.com/jeiwt/article/details/7979416</guid><author>jeiwt</author><pubDate>Fri, 14 Sep 2012 15:39:13 +0800</pubDate><description><![CDATA[01./* 
02.简单题 
03. 
04.求最长回文数，多阶段决策问题类动态规划 
05. 
06.题意：字符串S中包含的最长回文数为多长。即删除若干个字母后，剩余为回文数，问长度最长为多少。 
07. 
08.状态转移方程为:if(str[i]==str[j]) f[i][j]=f[i+1][j-1]+2; 
09.else f[i][j]=max(f[i+1][j],f[i][j-1]).]]></description><category></category></item></channel></rss>