<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[nanjunxiao的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/nanjunxiao</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; nanjunxiao]]></copyright><item><title><![CDATA[Leetcode：Wildcard Matching]]></title><link>https://blog.youkuaiyun.com/nanjunxiao/article/details/13006129</link><guid>https://blog.youkuaiyun.com/nanjunxiao/article/details/13006129</guid><author>nanjunxiao</author><pubDate>Thu, 24 Oct 2013 22:11:56 +0800</pubDate><description><![CDATA[Implement wildcard pattern matching with support for '?' and '*'.
'?' Matches any single character.
'*' Matches any sequence of characters (including the empty sequence).

The matching should cover t]]></description><category></category></item><item><title><![CDATA[Leetcode：Trapping Rain Water]]></title><link>https://blog.youkuaiyun.com/nanjunxiao/article/details/12978805</link><guid>https://blog.youkuaiyun.com/nanjunxiao/article/details/12978805</guid><author>nanjunxiao</author><pubDate>Wed, 23 Oct 2013 20:59:41 +0800</pubDate><description><![CDATA[Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.

For example, 
Given [0,1,0,2,1,0,1,3,2,1,2,1]]]></description><category></category></item><item><title><![CDATA[Leetcode：First Missing Positive]]></title><link>https://blog.youkuaiyun.com/nanjunxiao/article/details/12973173</link><guid>https://blog.youkuaiyun.com/nanjunxiao/article/details/12973173</guid><author>nanjunxiao</author><pubDate>Wed, 23 Oct 2013 16:27:01 +0800</pubDate><description><![CDATA[Given an unsorted integer array, find the first missing positive integer.

For example,
Given [1,2,0] return 3,
and [3,4,-1,1] return 2.

Your algorithm should run in O(n) time and uses constant]]></description><category></category></item><item><title><![CDATA[Leetcode：Combination Sum II]]></title><link>https://blog.youkuaiyun.com/nanjunxiao/article/details/12969017</link><guid>https://blog.youkuaiyun.com/nanjunxiao/article/details/12969017</guid><author>nanjunxiao</author><pubDate>Wed, 23 Oct 2013 11:33:52 +0800</pubDate><description><![CDATA[Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers
 sums to T.

Each number in C may only be used once in the combina]]></description><category></category></item><item><title><![CDATA[Leetcode:Combination Sum]]></title><link>https://blog.youkuaiyun.com/nanjunxiao/article/details/12956669</link><guid>https://blog.youkuaiyun.com/nanjunxiao/article/details/12956669</guid><author>nanjunxiao</author><pubDate>Tue, 22 Oct 2013 23:27:15 +0800</pubDate><description><![CDATA[Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums
 to T.

The same repeated number may be chosen from C unlimited numb]]></description><category></category></item><item><title><![CDATA[Search for a Range]]></title><link>https://blog.youkuaiyun.com/nanjunxiao/article/details/12950283</link><guid>https://blog.youkuaiyun.com/nanjunxiao/article/details/12950283</guid><author>nanjunxiao</author><pubDate>Tue, 22 Oct 2013 17:03:23 +0800</pubDate><description><![CDATA[Given a sorted array of integers, find the starting and ending position of a given target value.

Your algorithm's runtime complexity must be in the order of O(log n).

If the target is not found]]></description><category></category></item><item><title><![CDATA[Leetcode:Longest Valid Parentheses]]></title><link>https://blog.youkuaiyun.com/nanjunxiao/article/details/12945039</link><guid>https://blog.youkuaiyun.com/nanjunxiao/article/details/12945039</guid><author>nanjunxiao</author><pubDate>Tue, 22 Oct 2013 11:32:31 +0800</pubDate><description><![CDATA[Given a string containing just the characters '(' and ')',
 find the length of the longest valid (well-formed) parentheses substring.

For "(()", the longest valid parentheses substring is "()",]]></description><category></category></item><item><title><![CDATA[链表有无环经典问题汇总]]></title><link>https://blog.youkuaiyun.com/nanjunxiao/article/details/12876769</link><guid>https://blog.youkuaiyun.com/nanjunxiao/article/details/12876769</guid><author>nanjunxiao</author><pubDate>Sat, 19 Oct 2013 22:26:11 +0800</pubDate><description><![CDATA[参考
http://blog.youkuaiyun.com/vividonly/article/details/6673758]]></description><category></category></item><item><title><![CDATA[C++内存分配方式详解——堆、栈、自由存储区、全局/静态存储区和常量存储区]]></title><link>https://blog.youkuaiyun.com/nanjunxiao/article/details/12871391</link><guid>https://blog.youkuaiyun.com/nanjunxiao/article/details/12871391</guid><author>nanjunxiao</author><pubDate>Sat, 19 Oct 2013 15:27:30 +0800</pubDate><description><![CDATA[参考：

C++内存分配方式详解——堆、栈、自由存储区、全局/静态存储区和常量存储区

http://www.cnblogs.com/daocaoren/archive/2011/06/29/2092957.html





   BSS段、数据段、代码段、堆与栈


http://www.cppblog.com/prayer/archive/2009/08/17/93]]></description><category></category></item><item><title><![CDATA[如何判断两个矩形相交]]></title><link>https://blog.youkuaiyun.com/nanjunxiao/article/details/12749599</link><guid>https://blog.youkuaiyun.com/nanjunxiao/article/details/12749599</guid><author>nanjunxiao</author><pubDate>Tue, 15 Oct 2013 14:38:12 +0800</pubDate><description><![CDATA[假定矩形是用一对点表达的(minx, miny) (maxx, maxy)，那么两个矩形
    rect1{(minx1, miny1)(maxx1, maxy1)}
    rect2{(minx2, miny2)(maxx2, maxy2)}  
相交的结果一定是个矩形，构成这个相交矩形rect{(minx, miny) (maxx, maxy)}的点对坐标是：  
    minx]]></description><category></category></item><item><title><![CDATA[数组首元素地址和数组地址、int *ptr=(int *)(&a+1)问题的探讨]]></title><link>https://blog.youkuaiyun.com/nanjunxiao/article/details/12681827</link><guid>https://blog.youkuaiyun.com/nanjunxiao/article/details/12681827</guid><author>nanjunxiao</author><pubDate>Sun, 13 Oct 2013 17:06:50 +0800</pubDate><description><![CDATA[参考http://blog.youkuaiyun.com/tsaiyong_ahnselina/article/details/11863557
http://blog.youkuaiyun.com/yafeng_jiang/article/details/7321014



数组名a和&a 的区别
分类： c/c++ 2012-03-05 15:19 522人阅读 评论(2) 收藏 举报
       ]]></description><category></category></item><item><title><![CDATA[关系型数据库笔试面试题]]></title><link>https://blog.youkuaiyun.com/nanjunxiao/article/details/12623481</link><guid>https://blog.youkuaiyun.com/nanjunxiao/article/details/12623481</guid><author>nanjunxiao</author><pubDate>Fri, 11 Oct 2013 22:22:38 +0800</pubDate><description><![CDATA[第一、二、三范式
http://www.cnblogs.com/i233/archive/2009/04/08/1431627.html



聚集索引、非聚集索引
http://database.51cto.com/art/201104/257104.htm




唯一索引 聚集索引 非聚集索引


索引实际上是一组指向表中数据的指针,索引的排列顺序其实就是这组指针]]></description><category></category></item><item><title><![CDATA[求和问题总结(leetcode 2Sum, 3Sum, 4Sum, K Sum)]]></title><link>https://blog.youkuaiyun.com/nanjunxiao/article/details/12524405</link><guid>https://blog.youkuaiyun.com/nanjunxiao/article/details/12524405</guid><author>nanjunxiao</author><pubDate>Wed, 09 Oct 2013 20:51:31 +0800</pubDate><description><![CDATA[转载自：
http://tech-wonderland.net/blog/summary-of-ksum-problems.html



前言:


做过leetcode的人都知道, 里面有2sum, 3sum(closest), 4sum等问题, 这些也是面试里面经典的问题, 考察是否能够合理利用排序这个性质, 一步一步得到高效的算法. 经过总结, 本人觉得这些问题都可以使用一]]></description><category></category></item><item><title><![CDATA[Leetcode:3Sum Closest]]></title><link>https://blog.youkuaiyun.com/nanjunxiao/article/details/12524295</link><guid>https://blog.youkuaiyun.com/nanjunxiao/article/details/12524295</guid><author>nanjunxiao</author><pubDate>Wed, 09 Oct 2013 20:49:55 +0800</pubDate><description><![CDATA[Given an array S of n integers,
 find three integers in S such
 that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exa]]></description><category></category></item><item><title><![CDATA[精选的一些《编程之美》相关资料]]></title><link>https://blog.youkuaiyun.com/nanjunxiao/article/details/12524025</link><guid>https://blog.youkuaiyun.com/nanjunxiao/article/details/12524025</guid><author>nanjunxiao</author><pubDate>Wed, 09 Oct 2013 20:42:02 +0800</pubDate><description><![CDATA[转载自：http://blog.youkuaiyun.com/wuyuegb2312/article/details/9896831


又要到一年的招聘季了，肯定又有很多人开始啃《编程之美》了吧。这本书从开阔视野的角度来说很好，不过限于篇幅，有的问题并没有讲清楚（甚至问题叙述模棱两可、被标榜为“鼓励同面试官交流以获得更多细节”）；或者扩展问题本身很难，没有给予解答和提示。在我看书并在网络上查到的相关资]]></description><category></category></item><item><title><![CDATA[Regular Expression Matching 正则匹配问题]]></title><link>https://blog.youkuaiyun.com/nanjunxiao/article/details/12357781</link><guid>https://blog.youkuaiyun.com/nanjunxiao/article/details/12357781</guid><author>nanjunxiao</author><pubDate>Sun, 06 Oct 2013 21:13:46 +0800</pubDate><description><![CDATA[Implement regular expression matching with support for '.' and '*'.



'.' Matches any single character.
'*' Matches zero or more of the preceding element.

The matching should cover the entire in]]></description><category></category></item><item><title><![CDATA[最长回文串奇偶情况]]></title><link>https://blog.youkuaiyun.com/nanjunxiao/article/details/12347887</link><guid>https://blog.youkuaiyun.com/nanjunxiao/article/details/12347887</guid><author>nanjunxiao</author><pubDate>Sun, 06 Oct 2013 15:26:19 +0800</pubDate><description><![CDATA[Given a string S,
 find the longest palindromic substring in S.
 You may assume that the maximum length of S is
 1000, and there exists one unique longest palindromic substring.

class Solution {]]></description><category></category></item><item><title><![CDATA[Longest Substring Without Repeating Characters]]></title><link>https://blog.youkuaiyun.com/nanjunxiao/article/details/12342335</link><guid>https://blog.youkuaiyun.com/nanjunxiao/article/details/12342335</guid><author>nanjunxiao</author><pubDate>Sun, 06 Oct 2013 11:46:33 +0800</pubDate><description><![CDATA[Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without
 repeating letters for "abcabcbb" is "abc", which the length is 3. Fo]]></description><category></category></item><item><title><![CDATA[两个有序数组的中位数 Median of Two Sorted Arrays]]></title><link>https://blog.youkuaiyun.com/nanjunxiao/article/details/12322635</link><guid>https://blog.youkuaiyun.com/nanjunxiao/article/details/12322635</guid><author>nanjunxiao</author><pubDate>Sat, 05 Oct 2013 23:45:15 +0800</pubDate><description><![CDATA[Leetcode上的一道题：
There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time
 complexity should be O(log (m+n)).


class Solutio]]></description><category></category></item><item><title><![CDATA[常见概念笔试题]]></title><link>https://blog.youkuaiyun.com/nanjunxiao/article/details/12060907</link><guid>https://blog.youkuaiyun.com/nanjunxiao/article/details/12060907</guid><author>nanjunxiao</author><pubDate>Thu, 26 Sep 2013 18:23:31 +0800</pubDate><description><![CDATA[1.TCP建立连接的三次握手？
http://blog.youkuaiyun.com/whuslei/article/details/6667471



2.死锁的条件


互斥条件（Mutual exclusion）：资源不能被共享，只能由一个进程使用。请求与保持条件（Hold and wait）：已经得到资源的进程可以再次申请新的资源。非剥夺条件（No pre-emption）：已经分配]]></description><category></category></item></channel></rss>