<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ahen13519的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ahen13519</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ahen13519]]></copyright><item><title><![CDATA[使用 CreateInstallMedia 创建 苹果系统安装U盘]]></title><link>https://blog.youkuaiyun.com/ahen13519/article/details/101819983</link><guid>https://blog.youkuaiyun.com/ahen13519/article/details/101819983</guid><author>ahen13519</author><pubDate>Fri, 12 Dec 2014 15:56:00 +0800</pubDate><description><![CDATA[一般来说，从app store上面 下载下来的image位置，都是在 /Applications 下面

使用命令创建安装U盘，（备份一下命令，太长，记不住）

sudo /Applications/Install\ OS\ X\ Yosemite.app/Contents/Resources/createinstallmedia --volume /Volumes/USB -...]]></description><category></category></item><item><title><![CDATA[一些不错的英文歌曲MV，留个存档！]]></title><link>https://blog.youkuaiyun.com/ahen13519/article/details/101819979</link><guid>https://blog.youkuaiyun.com/ahen13519/article/details/101819979</guid><author>ahen13519</author><pubDate>Mon, 28 Oct 2013 16:09:00 +0800</pubDate><description><![CDATA[Lambada [[http://www.yinyuetai.com/video/265213]]Trouble Is A Friend [[http://www.yinyuetai.com/video/524509]]Silver Lining [[http://www.yinyuetai.com/video/208871]]Good Is Good [[http://www.yiny...]]></description><category></category></item><item><title><![CDATA[[转] 史上最全英文免费编程电子书列表]]></title><link>https://blog.youkuaiyun.com/ahen13519/article/details/101819980</link><guid>https://blog.youkuaiyun.com/ahen13519/article/details/101819980</guid><author>ahen13519</author><pubDate>Sat, 12 Oct 2013 17:21:00 +0800</pubDate><description><![CDATA[史上最全英文免费编程电子书列表

瑞士程序员Victor Felder在GitHub上放了一个免费电子书列表，是目前比较全的汇总，注意，其中的电子书都是作者或者出版社等版权所有人授权公开的，不是中文互联网到处都是的侵权电子版。这是StackOverflow上的列表基础上更新补充而成。
放到GitHub上之后，人人都可以补充、修改，这很有可能成为史上最全列表。当然，如果能对各领域图...]]></description><category></category></item><item><title><![CDATA[Write a program to convert decimal to 32-bit unsigned binary.]]></title><link>https://blog.youkuaiyun.com/ahen13519/article/details/101819977</link><guid>https://blog.youkuaiyun.com/ahen13519/article/details/101819977</guid><author>ahen13519</author><pubDate>Mon, 09 Sep 2013 22:48:00 +0800</pubDate><description><![CDATA[Write a program to convert decimal to 32-bit unsigned binary.
Write a program to convert a 32-bit unsigned binary to decimal
两个成对的问题！


转载于:https://www.cnblogs.com/yayagamer/p/3311239.html...]]></description><category></category></item><item><title><![CDATA[Top 5 Free Screen Recording Softwares For Windows]]></title><link>https://blog.youkuaiyun.com/ahen13519/article/details/101819975</link><guid>https://blog.youkuaiyun.com/ahen13519/article/details/101819975</guid><author>ahen13519</author><pubDate>Fri, 30 Aug 2013 15:46:00 +0800</pubDate><description><![CDATA[【转】Top 5 Free Screen Recording Softwares For Windows

该文章是转过来的，因为这里介绍了好几款免费的录制视频的软件。我自己需要使用，也许大家也有需求。


1. Ezvid
Ezvid is a screen recorder program that comes with an in-built video editor ...]]></description><category></category></item><item><title><![CDATA[Given life time of different animals. Find period when maximum number of animals lived]]></title><link>https://blog.youkuaiyun.com/ahen13519/article/details/101819978</link><guid>https://blog.youkuaiyun.com/ahen13519/article/details/101819978</guid><author>ahen13519</author><pubDate>Sun, 09 Jun 2013 17:10:00 +0800</pubDate><description><![CDATA[Q:
Given life time of different animals. Find period when maximum number of animals lived. 
ex [5, 11], [6, 18], [2, 5],[3,12] etc. year in which max no animals exists.

A:
Input intervals ...]]></description><category></category></item><item><title><![CDATA[there are atleast N pairs of x and y satisfying x^3 + y^3 = A]]></title><link>https://blog.youkuaiyun.com/ahen13519/article/details/101819974</link><guid>https://blog.youkuaiyun.com/ahen13519/article/details/101819974</guid><author>ahen13519</author><pubDate>Wed, 24 Apr 2013 17:21:00 +0800</pubDate><description><![CDATA[Q: function takes input x , y , A and Nreturns true ifthere are atleast N pairs of x and y satisfyingx^3 + y^3 = A;all inputs are postive integer values

A: Taxicab number
http://en.wikip...]]></description><category></category></item><item><title><![CDATA[Convert one string S1 to another string S2 using only 3 types of operations]]></title><link>https://blog.youkuaiyun.com/ahen13519/article/details/101819920</link><guid>https://blog.youkuaiyun.com/ahen13519/article/details/101819920</guid><author>ahen13519</author><pubDate>Wed, 24 Apr 2013 17:18:00 +0800</pubDate><description><![CDATA[Q: Suppose we want to convert one string S1 to another string S2 using only 3 types of operations:
-Insert(pos,char) (costs 8)-Delete(pos) (costs 6)-Replace(pos,char) (costs 8)Find the seque...]]></description><category></category></item><item><title><![CDATA[from given array of n elements find the maximum element for each consecutive sub-array of k elements...]]></title><link>https://blog.youkuaiyun.com/ahen13519/article/details/101819976</link><guid>https://blog.youkuaiyun.com/ahen13519/article/details/101819976</guid><author>ahen13519</author><pubDate>Wed, 20 Mar 2013 09:50:00 +0800</pubDate><description><![CDATA[Q: from given array of n elements find the maximum element for each consecutive sub-array of k elements.eg.array=[6,5,4,3,2,1]k=3ans=6 5 4 3explanation:6 from array [6,5,4]5 from array [5,4...]]></description><category></category></item><item><title><![CDATA[使用 VS 2012 编译 GTest 遇到的编译错误]]></title><link>https://blog.youkuaiyun.com/ahen13519/article/details/101819973</link><guid>https://blog.youkuaiyun.com/ahen13519/article/details/101819973</guid><author>ahen13519</author><pubDate>Sun, 10 Mar 2013 10:58:00 +0800</pubDate><description><![CDATA[下载好gtest-1.6.0，然后解压到一个目录下，比如e:\gtest-1.6.0
如果大家尝试着用VS2012 去编译GTest (e:\gtest-1.6.0\msvc\gtest.sln)，可能会碰到下面的编译错误：
\gtest\include\gtest\gtest-printers.h(550): error C2977: 'std::tuple' : too many...]]></description><category></category></item><item><title><![CDATA[Google 面试准备清单]]></title><link>https://blog.youkuaiyun.com/ahen13519/article/details/101819972</link><guid>https://blog.youkuaiyun.com/ahen13519/article/details/101819972</guid><author>ahen13519</author><pubDate>Fri, 22 Feb 2013 15:52:00 +0800</pubDate><description><![CDATA[看到一个，程序员面试清单，转过来，以后用得着
1. Integer      – find number of 1s      – next largest smaller      – smallest larger number      – determine if is palindrom      – itoa, atoi      – add 2 numbers w/...]]></description><category></category></item><item><title><![CDATA[Have an array we have to find longest subarray with consecutive numbers]]></title><link>https://blog.youkuaiyun.com/ahen13519/article/details/101819970</link><guid>https://blog.youkuaiyun.com/ahen13519/article/details/101819970</guid><author>ahen13519</author><pubDate>Fri, 25 Jan 2013 16:37:00 +0800</pubDate><description><![CDATA[Have an arraywe have to find longest subarray with consecutive numbers
ex [4,5,34,33,32,11,10,31]
answer is[31,32,33,34]





[92 26 30 28 27]

answer is [27, 28]




NOT [26, 2...]]></description><category></category></item><item><title><![CDATA[回到昨天，你能够从股市赚到最多的钱么？]]></title><link>https://blog.youkuaiyun.com/ahen13519/article/details/101819971</link><guid>https://blog.youkuaiyun.com/ahen13519/article/details/101819971</guid><author>ahen13519</author><pubDate>Fri, 25 Jan 2013 15:08:00 +0800</pubDate><description><![CDATA[Q:假设你可以回到昨天，并且得到股市昨天的全天每个时刻的数据，你能够通过买卖交易，赚取最多的钱么？
比如：
1. {10, 20, 15, 18, 22, 20, 4, 5}
{买入 卖出} 
{10, 20} {15, 22} {4, 5} 一共三次交易，赚了 10 + 7 + 1 = 18块钱

2. {5, 10, 9, 10, 11, 11, 12, 100}
...]]></description><category></category></item><item><title><![CDATA[[转] A sample of Multiply-with-carry, a pseudo-random number generator]]></title><link>https://blog.youkuaiyun.com/ahen13519/article/details/101819968</link><guid>https://blog.youkuaiyun.com/ahen13519/article/details/101819968</guid><author>ahen13519</author><pubDate>Fri, 25 Jan 2013 10:30:00 +0800</pubDate><description><![CDATA[The following is an implementation of the CMWC algorithm in theC programming language. Also, included in the program is a sample initialization function. In this implementation the lagr=4096...]]></description><category></category></item><item><title><![CDATA[Given an integer, return all sequences of numbers that sum to it]]></title><link>https://blog.youkuaiyun.com/ahen13519/article/details/101819966</link><guid>https://blog.youkuaiyun.com/ahen13519/article/details/101819966</guid><author>ahen13519</author><pubDate>Wed, 23 Jan 2013 16:24:00 +0800</pubDate><description><![CDATA[Q:
Given an integer, return all sequences of numbers that sum to it. (Example: 3 -&gt; (1, 2), (2, 1), (1, 1, 1)).
A:


class CalcSequenceNumber
{
private:
    static void print(int va...]]></description><category></category></item><item><title><![CDATA[What will be the change in complexity if we will choose 2 and 3 pivots in the quicksort algorithm]]></title><link>https://blog.youkuaiyun.com/ahen13519/article/details/101819969</link><guid>https://blog.youkuaiyun.com/ahen13519/article/details/101819969</guid><author>ahen13519</author><pubDate>Mon, 25 Jun 2012 10:55:00 +0800</pubDate><description><![CDATA[Q:
What will be the change in complexity if we will choose 2 and 3 pivots in the quicksort algorithm ?The exact complexity and why ??

A:
if we use 2 element as a pivot (suppose 1st and last...]]></description><category></category></item><item><title><![CDATA[Two sorted array. Find kth smallest element, 要求O(logK)]]></title><link>https://blog.youkuaiyun.com/ahen13519/article/details/101819967</link><guid>https://blog.youkuaiyun.com/ahen13519/article/details/101819967</guid><author>ahen13519</author><pubDate>Mon, 25 Jun 2012 10:46:00 +0800</pubDate><description><![CDATA[Two sorted array. Find kth smallest elementO(logK)

A:
Compare A[k/2] and B[k/2].If A[k/2] &lt; B[k/2], it means these A[1] to A[k/2] elements are part of first k elements.Now, the kth elemen...]]></description><category></category></item><item><title><![CDATA[Given an array of positive and negative integers find the first subarray with zero sum]]></title><link>https://blog.youkuaiyun.com/ahen13519/article/details/101819964</link><guid>https://blog.youkuaiyun.com/ahen13519/article/details/101819964</guid><author>ahen13519</author><pubDate>Sun, 24 Jun 2012 19:23:00 +0800</pubDate><description><![CDATA[Q:
Given an array of positive and negative integers find the first subarray with zero sum?
no 0's will be a part of the input array and handle all the edge cases

A:
1. iterate through the ...]]></description><category></category></item><item><title><![CDATA[顺时针打印数组，美丽版]]></title><link>https://blog.youkuaiyun.com/ahen13519/article/details/101819963</link><guid>https://blog.youkuaiyun.com/ahen13519/article/details/101819963</guid><author>ahen13519</author><pubDate>Sun, 24 Jun 2012 19:00:00 +0800</pubDate><description><![CDATA[今天看到一段代码，顺时针打印数组。写得太美了，简洁明了，几乎不用任何注释。
转过来，原来是java版的，我改成了C++版。


 1     void PrintMatrixClockWise()
 2     {
 3         int m = 5;
 4         int n = 4;
 5         int val[4][5] = 
 6   ...]]></description><category></category></item><item><title><![CDATA[Given a string S, find the longest palindromic substring in S.]]></title><link>https://blog.youkuaiyun.com/ahen13519/article/details/101819965</link><guid>https://blog.youkuaiyun.com/ahen13519/article/details/101819965</guid><author>ahen13519</author><pubDate>Sat, 09 Jun 2012 10:09:00 +0800</pubDate><description><![CDATA[题义很明细：求一个字符串S中的最长回文！  基本想法：  for-loop i从0 – (n-1)遍历该字符串，从S[i] 或者 S[i+1]开始，向字符串S的两侧展开，判断是不是回文。如果是，再和当前的最长回文比较，如果更长，则替换当前最长的回文。  代码如下：      // 从c1, c2开始 向两侧展开，找到最长的palindrome
    // e.g. 如果已经知道 "a...]]></description><category></category></item></channel></rss>