<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[coderhuhy的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/coderhuhy</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; coderhuhy]]></copyright><item><title><![CDATA[博客迁移]]></title><link>https://blog.youkuaiyun.com/coderhuhy/article/details/51470643</link><guid>https://blog.youkuaiyun.com/coderhuhy/article/details/51470643</guid><author>coderhuhy</author><pubDate>Sat, 21 May 2016 15:23:30 +0800</pubDate><description><![CDATA[已将博客迁移至简书。]]></description><category></category></item><item><title><![CDATA[清华大学研读间助手-清华小图Android]]></title><link>https://blog.youkuaiyun.com/coderhuhy/article/details/50382473</link><guid>https://blog.youkuaiyun.com/coderhuhy/article/details/50382473</guid><author>coderhuhy</author><pubDate>Tue, 22 Dec 2015 21:40:47 +0800</pubDate><description><![CDATA[捐赠二维码在本页的末尾:D。
还在为预定不到文图研读间而愁眉苦脸，每晚熬到零点只为抢到一个研读间才能安心睡觉吗？
还在因不知道文图剩余座位为零而白跑一趟，或傻傻苦等吗？
总因为赶不上研读间预约时间而承担着违约的风险，最终导致一个月无法预订研读间吗？
不用怕，不担心，清华小图来帮你:D！
清华小图的简介清华小图是一款面向全清华的师生的文科图书馆研读间智能预约助手。小图会为你提供全方位的文图研读间预订服]]></description><category></category></item><item><title><![CDATA[大数乘法(Multiply Strings)]]></title><link>https://blog.youkuaiyun.com/coderhuhy/article/details/46844961</link><guid>https://blog.youkuaiyun.com/coderhuhy/article/details/46844961</guid><author>coderhuhy</author><pubDate>Sat, 11 Jul 2015 21:51:48 +0800</pubDate><description><![CDATA[大数乘法的算法大数乘法的关键在于如何用字符串来模拟大数乘法。方法有如下几种：模拟普通的手算乘法、利用代数方法优化的乘法、快速傅立叶变换FFT。]]></description><category></category></item><item><title><![CDATA[Leetcode23-Merge k Sorted Lists]]></title><link>https://blog.youkuaiyun.com/coderhuhy/article/details/46837473</link><guid>https://blog.youkuaiyun.com/coderhuhy/article/details/46837473</guid><author>coderhuhy</author><pubDate>Sat, 11 Jul 2015 01:14:41 +0800</pubDate><description><![CDATA[Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.合并k个已排序的链表，并分析时间复杂度。k为可大可小的参数，表示需要合并的链表数目。]]></description><category></category></item><item><title><![CDATA[建堆O(n)时间复杂度证明]]></title><link>https://blog.youkuaiyun.com/coderhuhy/article/details/46832451</link><guid>https://blog.youkuaiyun.com/coderhuhy/article/details/46832451</guid><author>coderhuhy</author><pubDate>Fri, 10 Jul 2015 16:31:55 +0800</pubDate><description><![CDATA[建堆复杂度先考虑满二叉树，计算完全二叉树建堆复杂度基本相同。对满二叉树而言，第i层(根为第0层)有2^i个节点。由于建堆过程自底向上，以交换作为主要操作，因此第i层任意节点在最不利情况下，需要经过(n-i)次交换操作才能完成以该节点为堆根节点的建堆过程。]]></description><category></category></item><item><title><![CDATA[Leetcode233-Number of Digit One]]></title><link>https://blog.youkuaiyun.com/coderhuhy/article/details/46797809</link><guid>https://blog.youkuaiyun.com/coderhuhy/article/details/46797809</guid><author>coderhuhy</author><pubDate>Wed, 08 Jul 2015 00:56:16 +0800</pubDate><description><![CDATA[欢迎参观我的博客：Huhaoyu’s Blog。
Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.]]></description><category></category></item><item><title><![CDATA[Leetcode174-Dungeon Game]]></title><link>https://blog.youkuaiyun.com/coderhuhy/article/details/46638467</link><guid>https://blog.youkuaiyun.com/coderhuhy/article/details/46638467</guid><author>coderhuhy</author><pubDate>Thu, 25 Jun 2015 16:53:35 +0800</pubDate><description><![CDATA[骑士只能向下或向右移动，每个方格如果是正数表示加血，如果是负数表示扣血。血量等于或低于0时骑士死亡。求骑士从左上角出发并顺利到达右下角条件下的最小初始血量。
初步分析本题采用动态规划。分别从正向和反向考虑。]]></description><category></category></item><item><title><![CDATA[OpenCV实现图像搜索引擎(Image Search Engine)]]></title><link>https://blog.youkuaiyun.com/coderhuhy/article/details/46575667</link><guid>https://blog.youkuaiyun.com/coderhuhy/article/details/46575667</guid><author>coderhuhy</author><pubDate>Sat, 20 Jun 2015 21:26:53 +0800</pubDate><description><![CDATA[OpenCV（Open Source Computer Vision Library）的计算效率很高且能够完成实时任务。OpenCV库由优化的C/C++代码编写而成，能够充分发挥多核处理和硬件加速的优势。OpenCV有大量技术社区和超过900万的下载量，它的使用范围极为广泛，如人机互动、资源检查、拼接地图等。]]></description><category></category></item><item><title><![CDATA[聚类算法概述(k-Means++/FCM/凝聚层次聚类/DBSCAN)]]></title><link>https://blog.youkuaiyun.com/coderhuhy/article/details/46554567</link><guid>https://blog.youkuaiyun.com/coderhuhy/article/details/46554567</guid><author>coderhuhy</author><pubDate>Fri, 19 Jun 2015 00:19:45 +0800</pubDate><description><![CDATA[欢迎光临我的博客：HaoyuHu’s Blog
近期做完了labmu的tunet3.0，总算有时间学习一些东西了。目前想学的有聚类分析、图像识别算法和计算机网络方面的知识。在暑假实习期间，开始着手游戏编程。聚类的目的将数据划分为若干个簇，簇内相似性大，簇间相似性小，聚类效果好。用于从数据中提取信息和规律。]]></description><category></category></item><item><title><![CDATA[Leetcode220-Contains Duplicate III]]></title><link>https://blog.youkuaiyun.com/coderhuhy/article/details/46469013</link><guid>https://blog.youkuaiyun.com/coderhuhy/article/details/46469013</guid><author>coderhuhy</author><pubDate>Fri, 12 Jun 2015 10:56:44 +0800</pubDate><description><![CDATA[Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] and nums[j] is at most t and the difference between i and j is at most k]]></description><category></category></item><item><title><![CDATA[git整理commit的基本方法（拆分、合并、修改commit）]]></title><link>https://blog.youkuaiyun.com/coderhuhy/article/details/45952329</link><guid>https://blog.youkuaiyun.com/coderhuhy/article/details/45952329</guid><author>coderhuhy</author><pubDate>Sun, 24 May 2015 15:33:09 +0800</pubDate><description><![CDATA[觉得整理commit还是非常重要的一种技能，看到有人已经很好地整理过了，也搬运到自己的博客中，以备不时之需。本文转载自：Git整理Patch的一些经验。
U-Boot升级到了最后，需要将之前比较杂乱的commit重新整理，有的需要整合，有的需要拆分。在这个过程中深刻的体会到了git的强大和灵活性。这里总结一下大的步骤和中间用到的各种小技巧。]]></description><category></category></item><item><title><![CDATA[Kth Largest Element in an Array]]></title><link>https://blog.youkuaiyun.com/coderhuhy/article/details/45936629</link><guid>https://blog.youkuaiyun.com/coderhuhy/article/details/45936629</guid><author>coderhuhy</author><pubDate>Sat, 23 May 2015 19:36:12 +0800</pubDate><description><![CDATA[我的新博客地址：HuHaoyu’s Blog，欢迎参观。
Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.]]></description><category></category></item><item><title><![CDATA[Leetcode214-Shortest Palindrome]]></title><link>https://blog.youkuaiyun.com/coderhuhy/article/details/45935143</link><guid>https://blog.youkuaiyun.com/coderhuhy/article/details/45935143</guid><author>coderhuhy</author><pubDate>Sat, 23 May 2015 16:02:48 +0800</pubDate><description><![CDATA[我的新博客地址：HuHaoyu’s Blog，欢迎参观。
Find and return the shortest palindrome you can find by performing this transformation.]]></description><category></category></item><item><title><![CDATA[Leetcode213-House Robber II]]></title><link>https://blog.youkuaiyun.com/coderhuhy/article/details/45914851</link><guid>https://blog.youkuaiyun.com/coderhuhy/article/details/45914851</guid><author>coderhuhy</author><pubDate>Fri, 22 May 2015 11:16:30 +0800</pubDate><description><![CDATA[After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time, all houses at this place are arranged in a circle.]]></description><category></category></item><item><title><![CDATA[Leetcode212-Word Search II]]></title><link>https://blog.youkuaiyun.com/coderhuhy/article/details/45914337</link><guid>https://blog.youkuaiyun.com/coderhuhy/article/details/45914337</guid><author>coderhuhy</author><pubDate>Fri, 22 May 2015 10:44:59 +0800</pubDate><description><![CDATA[Each word must be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once in a word.]]></description><category></category></item><item><title><![CDATA[Android Studio应用指南]]></title><link>https://blog.youkuaiyun.com/coderhuhy/article/details/45867735</link><guid>https://blog.youkuaiyun.com/coderhuhy/article/details/45867735</guid><author>coderhuhy</author><pubDate>Wed, 20 May 2015 10:35:35 +0800</pubDate><description><![CDATA[本文转载自关于Android Studio，你需要知道的9件事。]]></description><category></category></item><item><title><![CDATA[Leetcode211 - Add and Search Word - Data structure design]]></title><link>https://blog.youkuaiyun.com/coderhuhy/article/details/45849021</link><guid>https://blog.youkuaiyun.com/coderhuhy/article/details/45849021</guid><author>coderhuhy</author><pubDate>Tue, 19 May 2015 19:55:06 +0800</pubDate><description><![CDATA[我的新博客地址：HuHaoyu's Blog，最近新增了Jekyll的paginator分页功能和Swiftype的搜索引擎。欢迎参观！]]></description><category></category></item><item><title><![CDATA[Pseudo-random algorithm: prd and rsa based]]></title><link>https://blog.youkuaiyun.com/coderhuhy/article/details/45750249</link><guid>https://blog.youkuaiyun.com/coderhuhy/article/details/45750249</guid><author>coderhuhy</author><pubDate>Fri, 15 May 2015 22:13:37 +0800</pubDate><description><![CDATA[我的新博客地址：Hu Haoyu’s Blog，欢迎参观。
计算机产生的大多数随机数都是伪随机数。是按照分布概率产生随机数字的过程，数字在概率分布上满足随机要求，但实际上是计算机通过随机函数模拟产生的。生成的方法包括直接法、逆转法、接受拒绝法等。本篇要介绍的是prd伪随机算法和基于rsa的伪随机算法。Pseudo Random Distribution这种伪随机算法在游戏中的应用非常广泛。]]></description><category></category></item><item><title><![CDATA[Leetcode210-Course Schedule II]]></title><link>https://blog.youkuaiyun.com/coderhuhy/article/details/45729597</link><guid>https://blog.youkuaiyun.com/coderhuhy/article/details/45729597</guid><author>coderhuhy</author><pubDate>Fri, 15 May 2015 00:30:24 +0800</pubDate><description><![CDATA[我的新博客地址：Hu Haoyu’s Blog，欢迎参观！
共有n节课程，课程编号从0至n-1。一些课程可能有先修要求，比如修0号课程前需要先修1号课程，表示为［0,1］。题目给出课程数和先后修课程对，要求返回完成所有课程的顺序。可能有很多正确的上课顺序，你只需返回其中一种。如果不可能完成，则返回空数组。]]></description><category></category></item><item><title><![CDATA[Leetcode209-Minimum Size Subarray Sum]]></title><link>https://blog.youkuaiyun.com/coderhuhy/article/details/45675875</link><guid>https://blog.youkuaiyun.com/coderhuhy/article/details/45675875</guid><author>coderhuhy</author><pubDate>Tue, 12 May 2015 22:07:27 +0800</pubDate><description><![CDATA[Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return 0 instead.]]></description><category></category></item></channel></rss>