<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ycc892009的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ycc892009</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ycc892009]]></copyright><item><title><![CDATA[双击表格td进行编辑]]></title><link>https://blog.youkuaiyun.com/ycc892009/article/details/6704489</link><guid>https://blog.youkuaiyun.com/ycc892009/article/details/6704489</guid><author>ycc892009</author><pubDate>Sat, 20 Aug 2011 16:41:49 +0800</pubDate><description><![CDATA[$(function(){ 
    //隔行换色 
   // $("tbody tr:odd").css("background-color","#eee"); 
		var numId = $(".tbody td"); 
    numId.dblclick(fu]]></description><category></category></item><item><title><![CDATA[jquery表格增加删除行操作]]></title><link>https://blog.youkuaiyun.com/ycc892009/article/details/6704487</link><guid>https://blog.youkuaiyun.com/ycc892009/article/details/6704487</guid><author>ycc892009</author><pubDate>Sat, 20 Aug 2011 16:39:55 +0800</pubDate><description><![CDATA[jQuery表格操作添加行、删除行和动态移动丨芯晴网页特效丨CsrCode.Cn



添加一行  删除一行  上移  下移

序号步骤名称步骤描述相关操作




var currentStep=0;
var max_line_num=0;
funct]]></description><category></category></item><item><title><![CDATA[分享按钮]]></title><link>https://blog.youkuaiyun.com/ycc892009/article/details/6697229</link><guid>https://blog.youkuaiyun.com/ycc892009/article/details/6697229</guid><author>ycc892009</author><pubDate>Thu, 18 Aug 2011 10:19:33 +0800</pubDate><description><![CDATA[share

	分享按钮
	<script language="javascript" type="text/javascript"
		src="http://static.bshare.cn/b/buttonLite.js#uuid=&
		style=2&text]]></description><category></category></item><item><title><![CDATA[php引入lucene搜索引擎方法.]]></title><link>https://blog.youkuaiyun.com/ycc892009/article/details/6680870</link><guid>https://blog.youkuaiyun.com/ycc892009/article/details/6680870</guid><author>ycc892009</author><pubDate>Fri, 12 Aug 2011 10:15:19 +0800</pubDate><description><![CDATA[1、lucene包的下载地址:http://apache.etoak.com/lucene/java/3.3.0/
2、下载jdk环境
3、下载JavaBridge URL:http://sourceforge.net/projects/php-java-bridge/]]></description><category></category></item><item><title><![CDATA[为什么推荐使用谷歌加载jquery库文件]]></title><link>https://blog.youkuaiyun.com/ycc892009/article/details/6665377</link><guid>https://blog.youkuaiyun.com/ycc892009/article/details/6665377</guid><author>ycc892009</author><pubDate>Sat, 06 Aug 2011 15:50:35 +0800</pubDate><description><![CDATA[!window.jQuery && document.write('');
 
 
为什么推荐使用谷歌加载jquery库文件
发表于 
2011 年 03 月 10 日 由
梦三秋


有的同学估计看了这个文章的题目，还莫名其妙不知所谓吧，呵呵~不要紧，接下来梦]]></description><category></category></item><item><title><![CDATA[class分页类连接数据库类]]></title><link>https://blog.youkuaiyun.com/ycc892009/article/details/6660223</link><guid>https://blog.youkuaiyun.com/ycc892009/article/details/6660223</guid><author>ycc892009</author><pubDate>Thu, 04 Aug 2011 15:51:26 +0800</pubDate><description><![CDATA[custom.class.inc.php<?php
// 连接数据库的类
class ConnDB
{
		var $dbtype;
		var $host;
		var $usr;
		var $pwd;
		var $dbname;
		var $conn;]]></description><category></category></item><item><title><![CDATA[js 格式化时间函数]]></title><link>https://blog.youkuaiyun.com/ycc892009/article/details/6660218</link><guid>https://blog.youkuaiyun.com/ycc892009/article/details/6660218</guid><author>ycc892009</author><pubDate>Thu, 04 Aug 2011 15:48:44 +0800</pubDate><description><![CDATA[function time()
{

/**  
 * 时间对象的格式化;  
 */  
Date.prototype.format = function(format) {   
    /*  
     * eg:format="YYYY-MM-dd hh]]></description><category></category></item><item><title><![CDATA[php封装操作数据库的类]]></title><link>https://blog.youkuaiyun.com/ycc892009/article/details/6641462</link><guid>https://blog.youkuaiyun.com/ycc892009/article/details/6641462</guid><author>ycc892009</author><pubDate>Thu, 28 Jul 2011 16:32:38 +0800</pubDate><description><![CDATA[ConnDB.class.inc.php文件

<?php
// 连接数据库的类
class ConnDB
{
		var $dbtype;
		var $host;
		var $usr;
		var $pwd;
		var $dbname;
		var $conn;]]></description><category></category></item><item><title><![CDATA[用户注册页面--ajax.php.js.css]]></title><link>https://blog.youkuaiyun.com/ycc892009/article/details/6641189</link><guid>https://blog.youkuaiyun.com/ycc892009/article/details/6641189</guid><author>ycc892009</author><pubDate>Thu, 28 Jul 2011 15:32:09 +0800</pubDate><description><![CDATA[新用户注册
     
    
    
    
    
    



    
     
        
            新用户注册
        
        
          用户名：
           
               *]]></description><category></category></item><item><title><![CDATA[php验证码的实现]]></title><link>https://blog.youkuaiyun.com/ycc892009/article/details/6641111</link><guid>https://blog.youkuaiyun.com/ycc892009/article/details/6641111</guid><author>ycc892009</author><pubDate>Thu, 28 Jul 2011 15:11:58 +0800</pubDate><description><![CDATA[//


	yzm
	
	function yzm()
	{
	var num1=Math.round(Math.random()*10000000);
	var num=num1.toString().substr(0,4);
	document.write("");
	
	}]]></description><category></category></item><item><title><![CDATA[js删除一行下面的文字往上移动]]></title><link>https://blog.youkuaiyun.com/ycc892009/article/details/6632755</link><guid>https://blog.youkuaiyun.com/ycc892009/article/details/6632755</guid><author>ycc892009</author><pubDate>Mon, 25 Jul 2011 18:06:49 +0800</pubDate><description><![CDATA[document.getElementById(str).style.display="none";

	
    
	function ondelete(str)
	{
	document.getElementById(str).style.display="non]]></description><category></category></item><item><title><![CDATA[c语言细节中的文件归类代码]]></title><link>https://blog.youkuaiyun.com/ycc892009/article/details/6523291</link><guid>https://blog.youkuaiyun.com/ycc892009/article/details/6523291</guid><author>ycc892009</author><pubDate>Fri, 13 May 2011 22:18:00 +0800</pubDate><description><![CDATA[ 题目：把a.txt文件中的内容，同一个地点的姓名归为一类。输出的时候按类输出。并且计算每类地址中姓名的总数。Code:    #include       #include       #include       #define N 100            typedef struct PERSOONSTRU      {       ]]></description><category></category></item><item><title><![CDATA[c语言中的一些细节]]></title><link>https://blog.youkuaiyun.com/ycc892009/article/details/6523289</link><guid>https://blog.youkuaiyun.com/ycc892009/article/details/6523289</guid><author>ycc892009</author><pubDate>Fri, 13 May 2011 21:41:00 +0800</pubDate><description><![CDATA[2011 国信蓝点的软件大赛就要开始了，所以这几天都是用标准c语言规则去写一些代码。
以前都是用.cpp编译的。由于大赛严格使用的是c语言，所以编译的时候都是用.c文件。
想不到用.c写的一个对文件内容进行归类的程序，竟然错误百出。这些错误如果是写成。cpp
的话是没有任何问题的。接下来我就谈谈我遇到错误的一些细节吧。
1、函数前不要插入临时变量
2、结构体中定义了二维数组或者定义了另一]]></description><category></category></item><item><title><![CDATA[国信蓝点2011c本科概率问题]]></title><link>https://blog.youkuaiyun.com/ycc892009/article/details/6523249</link><guid>https://blog.youkuaiyun.com/ycc892009/article/details/6523249</guid><author>ycc892009</author><pubDate>Thu, 12 May 2011 22:55:00 +0800</pubDate><description><![CDATA[某游戏规则中，甲乙双方每个回合的战斗总是有一方胜利，一方失败。游戏规定：失败的一方要把自己的体力值的1/4加给胜利的一方。例如：如果双方体力值当前都是4，则经过一轮战斗后，双方的体力值会变为：5：3。现在已知：双方开始时的体力值甲：1000，乙：2000。假设战斗中，甲乙获胜的概率都是50%求解：双方经过4个回合的战斗，体力值之差小于1000的理论概率。 Code:]]></description><category></category></item><item><title><![CDATA[二元一次不定方程]]></title><link>https://blog.youkuaiyun.com/ycc892009/article/details/6523215</link><guid>https://blog.youkuaiyun.com/ycc892009/article/details/6523215</guid><author>ycc892009</author><pubDate>Wed, 11 May 2011 23:06:00 +0800</pubDate><description><![CDATA[Code:    /******************      二元一次不定方程求解      给定a,b,c求ax+by=c的整数解。       解：      用到的定理       1、gcd(a,b)=gcd(b,a mod b)       2、若d|a且d|b，则d|ax+by（gcd(a,b)|ax+by）       *****]]></description><category></category></item><item><title><![CDATA[动态规划解决矩阵左上角到右下角距离最大]]></title><link>https://blog.youkuaiyun.com/ycc892009/article/details/6523167</link><guid>https://blog.youkuaiyun.com/ycc892009/article/details/6523167</guid><author>ycc892009</author><pubDate>Tue, 10 May 2011 17:16:00 +0800</pubDate><description><![CDATA[Code:    /******************************************************************     funciton:给定一个数字矩阵求从左上角到右下角距离最大。输出最大距离值。     condition:路径只能是往右与往下走。     Example     Input:     2 2 ]]></description><category></category></item><item><title><![CDATA[图像处理博客]]></title><link>https://blog.youkuaiyun.com/ycc892009/article/details/6523145</link><guid>https://blog.youkuaiyun.com/ycc892009/article/details/6523145</guid><author>ycc892009</author><pubDate>Mon, 09 May 2011 22:51:00 +0800</pubDate><description><![CDATA[ http://blog.ednchina.com/webuserzhy/31065/category.aspx?page=2]]></description><category></category></item><item><title><![CDATA[n个数的排列]]></title><link>https://blog.youkuaiyun.com/ycc892009/article/details/6521664</link><guid>https://blog.youkuaiyun.com/ycc892009/article/details/6521664</guid><author>ycc892009</author><pubDate>Sun, 10 Apr 2011 20:17:00 +0800</pubDate><description><![CDATA[ 1求n个数的排列递归算法不重复。Code:    /*         可以使用遞迴將問題切割為較小的單元進行排列組合，         例如1 2 3 4的排列可以分為1 [2 3 4]、2 [1 3 4]、         3 [1 2 4]、4 [1 2 3]進行排列，         這邊利用旋轉法，先將旋轉間隔設為0，         將]]></description><category></category></item><item><title><![CDATA[C(n,m)的组合问题]]></title><link>https://blog.youkuaiyun.com/ycc892009/article/details/6521594</link><guid>https://blog.youkuaiyun.com/ycc892009/article/details/6521594</guid><author>ycc892009</author><pubDate>Sat, 09 Apr 2011 13:53:00 +0800</pubDate><description><![CDATA[// 回溯算法    void   comb_back(int a[],int   m,int   r)        {                  int   i,j,k=0;             i=0,a[i]=1;        do      {            if (a[i]-i        {       ]]></description><category></category></item><item><title><![CDATA[剪切板操作SetClipboardData GetClipboardData]]></title><link>https://blog.youkuaiyun.com/ycc892009/article/details/6521565</link><guid>https://blog.youkuaiyun.com/ycc892009/article/details/6521565</guid><author>ycc892009</author><pubDate>Fri, 08 Apr 2011 21:13:00 +0800</pubDate><description><![CDATA[Code:    // Funciton：        // 拷贝数据到剪切板       // 从剪切板粘贴数据        // Data：2011/4/8        #include        #include        void SetDataToClip(void)        {           // 打开剪贴板]]></description><category></category></item></channel></rss>