<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[minggr的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/minggr</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; minggr]]></copyright><item><title><![CDATA[No. 47 - Search in a Rotation of an Array]]></title><link>https://blog.youkuaiyun.com/minggr/article/details/37888787</link><guid>https://blog.youkuaiyun.com/minggr/article/details/37888787</guid><author>minggr</author><pubDate>Wed, 16 Jul 2014 22:57:59 +0800</pubDate><description><![CDATA[参考：http://codercareer.blogspot.com/2013/03/no-47-search-in-rotation-of-array_31.html]]></description><category></category></item><item><title><![CDATA[Least Number after Deleting Digits]]></title><link>https://blog.youkuaiyun.com/minggr/article/details/37808181</link><guid>https://blog.youkuaiyun.com/minggr/article/details/37808181</guid><author>minggr</author><pubDate>Tue, 15 Jul 2014 08:51:04 +0800</pubDate><description><![CDATA[Problem: Please
 get the least number after deleting k digits
 from the input number. For example, if the input number is 24635, the least number is 23 after deleting 3 digits.
参考：http://codercaree]]></description><category></category></item><item><title><![CDATA[Longest Substring without Duplication]]></title><link>https://blog.youkuaiyun.com/minggr/article/details/37786673</link><guid>https://blog.youkuaiyun.com/minggr/article/details/37786673</guid><author>minggr</author><pubDate>Tue, 15 Jul 2014 02:38:40 +0800</pubDate><description><![CDATA[Problem: Given
 a string, please get the length of the longest substring which does not have duplicated characters. Supposing all characters in the string are in the range from ‘a’ to ‘z’.
妙处在于如何正确定]]></description><category></category></item><item><title><![CDATA[Numbers Appearing Once]]></title><link>https://blog.youkuaiyun.com/minggr/article/details/37786635</link><guid>https://blog.youkuaiyun.com/minggr/article/details/37786635</guid><author>minggr</author><pubDate>Tue, 15 Jul 2014 02:37:01 +0800</pubDate><description><![CDATA[Problem: In
 an array, all numbers appear three times except one which only appears only once. Please find the unique number.
参考：http://codercareer.blogspot.com/2013/12/no-50-numbers-appearing-once.]]></description><category></category></item><item><title><![CDATA[Next Number with Same Set of Digits]]></title><link>https://blog.youkuaiyun.com/minggr/article/details/37752297</link><guid>https://blog.youkuaiyun.com/minggr/article/details/37752297</guid><author>minggr</author><pubDate>Mon, 14 Jul 2014 04:25:34 +0800</pubDate><description><![CDATA[Problem: Reorder
 the digits of a number, in order to get the next number which is the least one that is greater than the input number. For example, the number 34724126 is the next number of 34722641]]></description><category></category></item><item><title><![CDATA[装配线调度问题]]></title><link>https://blog.youkuaiyun.com/minggr/article/details/37730319</link><guid>https://blog.youkuaiyun.com/minggr/article/details/37730319</guid><author>minggr</author><pubDate>Sat, 12 Jul 2014 23:18:18 +0800</pubDate><description><![CDATA[/* Copyleft: Ming Lin  */

#include 
#include 

void print_line(int *l, int n)
{
	int i;

	for (i = 0; i < n; i++)
		printf("line %d, station %d\n", l[i]+1, i+1);
}

int fastest_way(int s_entry[2], in]]></description><category></category></item><item><title><![CDATA[Maximal Product when Cutting Rope]]></title><link>https://blog.youkuaiyun.com/minggr/article/details/37725707</link><guid>https://blog.youkuaiyun.com/minggr/article/details/37725707</guid><author>minggr</author><pubDate>Sat, 12 Jul 2014 14:28:22 +0800</pubDate><description><![CDATA[Problem: Given a rope with length n, how to cut the rope into m parts with length n[0], n[1], ...,n[m-1], in order to get the maximal product of n[0]*n[1]*
 ... *n[m-1]? We have to cut once at least.]]></description><category></category></item><item><title><![CDATA[Longest Arithmetic Sequence - Question 3]]></title><link>https://blog.youkuaiyun.com/minggr/article/details/37721557</link><guid>https://blog.youkuaiyun.com/minggr/article/details/37721557</guid><author>minggr</author><pubDate>Sat, 12 Jul 2014 08:32:42 +0800</pubDate><description><![CDATA[/* Copyleft: Ming Lin  */

#include 
#include 
#include 

struct element {
	int key;
	struct element *next;
	struct element *tail;
};

struct hash {
	int size;
	struct element **head;
	int first;
};

]]></description><category></category></item><item><title><![CDATA[Longest Arithmetic Sequence - Question 1]]></title><link>https://blog.youkuaiyun.com/minggr/article/details/37719513</link><guid>https://blog.youkuaiyun.com/minggr/article/details/37719513</guid><author>minggr</author><pubDate>Sat, 12 Jul 2014 05:57:24 +0800</pubDate><description><![CDATA[Question 1: Given
 an array, please get the length of the longest arithmetic sequence. The element order in the arithmetic sequence should be same as the element order in the array. For example, in t]]></description><category></category></item><item><title><![CDATA[Three Increasing Elements in an Array]]></title><link>https://blog.youkuaiyun.com/minggr/article/details/37657241</link><guid>https://blog.youkuaiyun.com/minggr/article/details/37657241</guid><author>minggr</author><pubDate>Thu, 10 Jul 2014 15:35:31 +0800</pubDate><description><![CDATA[Problem: Given
 an array of integers A, please find three indexes i, j, k,
 such that ijk and
 A[i]j]k].
cd]]></description><category></category></item><item><title><![CDATA[Group of 1s in a Matrix]]></title><link>https://blog.youkuaiyun.com/minggr/article/details/37655281</link><guid>https://blog.youkuaiyun.com/minggr/article/details/37655281</guid><author>minggr</author><pubDate>Thu, 10 Jul 2014 13:53:37 +0800</pubDate><description><![CDATA[Problem: Given
 a matrix with 1s and 0s, please find the number of groups of 1s. A group is defined by horizontally or vertically adjacent 1s. For example, there are four groups of 1s in Figure 1 whi]]></description><category></category></item><item><title><![CDATA[如何用一个月的时间准备google的技术面试]]></title><link>https://blog.youkuaiyun.com/minggr/article/details/37563095</link><guid>https://blog.youkuaiyun.com/minggr/article/details/37563095</guid><author>minggr</author><pubDate>Tue, 08 Jul 2014 13:39:09 +0800</pubDate><description><![CDATA[点击打开链接]]></description><category></category></item><item><title><![CDATA[Median in Stream]]></title><link>https://blog.youkuaiyun.com/minggr/article/details/37509859</link><guid>https://blog.youkuaiyun.com/minggr/article/details/37509859</guid><author>minggr</author><pubDate>Mon, 07 Jul 2014 14:21:30 +0800</pubDate><description><![CDATA[Question: How
 to get the median from a stream of numbers at any time? The median is middle value of numbers. If the count of numbers is even, the median is defined as the average value of the two nu]]></description><category></category></item><item><title><![CDATA[A Pair with the Maximal Difference]]></title><link>https://blog.youkuaiyun.com/minggr/article/details/36768723</link><guid>https://blog.youkuaiyun.com/minggr/article/details/36768723</guid><author>minggr</author><pubDate>Fri, 04 Jul 2014 02:33:20 +0800</pubDate><description><![CDATA[A Pair with the Maximal Difference


Problem: A pair contains two numbers, and its second number is on the right side of the first one in an array. The difference of a pair is the minus result whil]]></description><category></category></item><item><title><![CDATA[Maximum Sum of All Sub-arrays]]></title><link>https://blog.youkuaiyun.com/minggr/article/details/36486759</link><guid>https://blog.youkuaiyun.com/minggr/article/details/36486759</guid><author>minggr</author><pubDate>Thu, 03 Jul 2014 02:30:57 +0800</pubDate><description><![CDATA[Question: A sub-array has one number of some continuous numbers. Given an integer array with positive numbers and negative numbers, get the maximum sum of all sub-arrays. Time complexity should be O(n]]></description><category></category></item></channel></rss>