• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            隨筆 - 87  文章 - 279  trackbacks - 0
            <2010年5月>
            2526272829301
            2345678
            9101112131415
            16171819202122
            23242526272829
            303112345

            潛心看書研究!

            常用鏈接

            留言簿(19)

            隨筆分類(81)

            文章分類(89)

            相冊

            ACM OJ

            My friends

            搜索

            •  

            積分與排名

            • 積分 - 217774
            • 排名 - 117

            最新評論

            閱讀排行榜

            評論排行榜

            當k比較小的時候,可獲得O(n)的時間復雜度.

            #include? < iostream >
            using?namespace?std;

            const ? int ?arrLen? = ? 5 ;

            void ?countingSort( int ? * a,? int ? * b,? int ?k)? {
            ????
            // a數組元素在[0..k]
            ???? int ?i,?j;
            ????
            int ? * c? = ? new ? int [k + 1 ];
            ????
            for ?(i = 0 ;?i <= k;?i ++ )?c[i]? = ? 0 ;
            ????
            for ?(i = 0 ;?i < arrLen;?i ++ )?c[a[i]] ++ ;
            ????
            // 包含小于或等于i的元素個數
            ???? for ?(i = 1 ;?i <= k;?i ++ )?c[i]? += ?c[i - 1 ];
            ????
            for ?(j = arrLen - 1 ;?j >= 0 ;?j -- )? {
            ????????b[c[a[j]]
            - 1 ]? = ?a[j];
            ????????c[a[j]]
            -- ;
            ????}

            }


            int ?main()? {
            ????
            int ?a[arrLen]? = ? { 4 ,? 4 ,? 3 ,? 1 ,? 1 } ;
            ????
            int ?b[arrLen];
            ????countingSort(a,?b,?
            5 );
            ????
            for ?( int ?i = 0 ;?i < 5 ;?i ++ )? {
            ????????printf(
            " %d? " ,?b[i]);
            ????}

            ????printf(
            " \n " );
            ????system(
            " pause " );
            }

            posted @ 2007-02-06 20:43 豪 閱讀(694) | 評論 (2)編輯 收藏
            創建http_request對象

            function?createAjaxObj()?{
            ????
            var?http_request?=?false;
            ????
            if?(window.XMLHttpRequest)?{?//?Mozilla,?Safari,
            ????????http_request?=?new?XMLHttpRequest();
            ????????
            if?(http_request.overrideMimeType)?{
            ????????????http_request.overrideMimeType('text
            /xml');
            ????????}

            ????}
            ?else?if?(window.ActiveXObject)?{?//?IE
            ????????try?{
            ????????????http_request?
            =?new?ActiveXObject("Msxml2.XMLHTTP");
            ????????}
            ?catch?(e)?{
            ????????????
            try?{
            ????????????????http_request?
            =?new?ActiveXObject("Microsoft.XMLHTTP");
            ????????????}
            ?catch?(e)?{}
            ????????}

            ????}

            ????
            return?http_request;
            }

            http_request對象的使用

            ????function?ajax_add(obj)?{
            ????????
            var?http_request?=?createAjaxObj();
            ????????
            var?feedURL?=?obj.feedURL;
            ????????
            var?feedName?=?obj.feedName;
            ????????http_request.onreadystatechange?
            =?function()?{
            ????????????
            if?(http_request.readyState?==?4)?{
            ????????????????
            if?(http_request.status?==?200)?{
            ????????????????????
            //接收服務器返回信息responseText或responseXML
            ????????????????????var?text_data?=?http_request.responseText;
            ????????????????????
            var?parentNode?=?document.getElementById("leftcolumn");
            ????????????????????
            var?newDiv?=?document.createElement("div");
            ????????????????????newDiv.innerHTML?
            =?unescape(text_data);
            ????????????????????parentNode.appendChild(newDiv);
            ????????????????????waiting.innerHTML?
            =?"";
            ????????????????}

            ????????????}

            ????????}

            ????????
            var?submitURL?=?"add_rss.php";
            ????????http_request.open(
            "POST",?submitURL,?true);
            ????????http_request.setRequestHeader(
            "Content-Type","application/x-www-form-urlencoded");?
            ????????http_request.send(
            "feedURL="+feedURL.value+"&feedName="+escape(feedName.value));
            ????????
            var?waiting?=?document.getElementById("waiting");
            ????????waiting.innerHTML?
            =?"正在載入";
            ????????
            //http_request.send(null);
            ????}
            posted @ 2007-02-05 19:54 豪 閱讀(852) | 評論 (0)編輯 收藏
            循環不變式

            循環不變式主要用來幫助我們理解算法的正確性。

            初始化:它在循環的第一輪迭代開始之前,應該是正確的。

            保持:如果在循環的某一次迭代開始之前它是正確,那么,在下一次迭代開始之前,它也應該保持正確。

            終止:當循環結束時,不變式給了我們一個有用的性質,它有助于表明算法是正確的。
            posted @ 2007-02-05 19:43 豪 閱讀(413) | 評論 (0)編輯 收藏
            沒辦法,近來靠php吃飯-_-
            <?
            /*************
            |?+-------------------------------------------------
            |?Id:??????????????????????????????
            |?+-------------------------------------------------
            |?Copyright?(c)?
            |?Author:Howie
            |?Email:?qywyh_scut@163.com
            |?+-------------------------------------------------
            |?Create?Date:?2007-2-3
            |?Modify?Date:?
            |?Note:??
            |?demo:
            |???$objRSS?=?new?loadRSS('http://news.163.com/special/00011K6L/rss_gn.xml',?10,?'cache/test.xml');
            |???echo?$objRSS->getRSS();
            |
            |?+-------------------------------------------------
            **************
            */
            class?loadRSS?{
            ????
            ????
            //RSS?url鏈接
            ????var?$_url?=?'';

            ????
            //RSS?緩存目錄
            ????var?$_cacheDir?=?'';

            ????
            //緩存時間
            ????var?$_cacheTime?=?'';

            ????
            //是否從緩存讀取
            ????var?$_loadFromCache?=?true;

            ????
            //保存rss字符串
            ????var?$_str?=?'';

            ????
            function?loadRSS?($url,?$cacheTime=0,?$cacheDir=''){
            ????????
            $this->_url?=?$url;
            ????????
            if?($cacheDir?==?''?||?$cacheTime?==?0)?{
            ????????????
            $this->_loadFromCache?=?false;
            ????????}?
            else?{
            ????????????
            $this->_cacheTime?=?$cacheTime;
            ????????????
            $this->_cacheDir?=?$cacheDir;
            ????????}
            ????}

            ????
            function?getRSS?()?{
            ????????
            if?(!$this->_loadFromCache)?{
            ????????????
            $fp?=?fopen($this->_url,?'r');
            ????????????
            while?($tmp?=?fgets($fp,?4096))?{
            ????????????????
            $this->_str?.=?$tmp;
            ????????????}
            ????????????
            fclose($fp);
            ????????????
            //echo?$this->_str;
            ????????}?else?{
            ????????????
            $fileModifyTime?=?@filemtime($this->_cacheDir);
            ????????????
            $nowTime?=?time();
            ????????????
            //修改緩存文件
            ????????????if?(!$fileModifyTime?||?$nowTime-$fileModifyTime?>=?$this->_cacheTime)?{
            ????????????????
            $fp?=?fopen($this->_url,?'r');
            ????????????????
            $fp2?=?fopen($this->_cacheDir,?'w');
            ????????????????
            while?($tmp?=?fgets($fp,?4096))?{
            ????????????????????
            fwrite($fp2,?$tmp);
            ????????????????????
            $this->_str?.=?$tmp;
            ????????????????}
            ????????????????
            fclose($fp);
            ????????????????
            fclose($fp2);
            ????????????????
            return?$this->_str;
            ????????????}
            ????????????
            $fp?=?fopen($this->_cacheDir,?'r');
            ????????????
            while?($tmp?=?fgets($fp,?4096))?{
            ????????????????
            $this->_str?.=?$tmp;
            ????????????}
            ????????????
            fclose($fp);
            ????????}
            ????????
            return?$this->_str;
            ????}

            }
            ?>
            posted @ 2007-02-03 01:32 豪 閱讀(365) | 評論 (0)編輯 收藏

               以后不想在這里寫心情了,這里就只記錄一些技術性文章吧~

            posted @ 2007-01-16 01:30 豪 閱讀(185) | 評論 (0)編輯 收藏
            僅列出標題
            共18頁: First 3 4 5 6 7 8 9 10 11 Last 
            久久精品9988| 老男人久久青草av高清| 久久综合给合久久狠狠狠97色69| 久久热这里只有精品在线观看| 国产成人精品综合久久久久| 久久婷婷国产综合精品| 久久精品视频91| 欧美噜噜久久久XXX| 精品久久久久久久久久中文字幕 | 国产精品视频久久久| 久久久久久噜噜精品免费直播| 亚洲中文字幕无码久久综合网| 香蕉久久夜色精品国产小说| 国产欧美久久久精品影院| 国产成人久久777777| 国内精品久久久久影院日本 | 久久国产成人午夜aⅴ影院| 亚洲国产精品一区二区久久hs | 久久综合精品国产二区无码| 久久久久免费视频| 国内精品久久久久影院免费| 久久久久久久波多野结衣高潮| 国产日韩久久久精品影院首页| 人妻少妇久久中文字幕一区二区| 亚洲国产精品无码久久青草| 2020最新久久久视精品爱| 国产成人久久精品一区二区三区| 久久精品中文字幕一区| 性做久久久久久免费观看| 久久久精品久久久久久| 久久99精品久久久久久水蜜桃| 精品熟女少妇av免费久久| 久久精品国产亚洲AV香蕉| 久久天天躁狠狠躁夜夜网站| 久久国产劲爆AV内射—百度| 中文无码久久精品| 亚洲精品乱码久久久久久 | 久久久久国产精品麻豆AR影院| 热99re久久国超精品首页| 伊人久久大香线焦综合四虎 | 囯产精品久久久久久久久蜜桃|