<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Snowwolf_Yang的程序化生活]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/chinasnowwolf</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; chinasnowwolf]]></copyright><item><title><![CDATA[【LeetCode】Combination Sum && II]]></title><link>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38933151</link><guid>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38933151</guid><author>chinasnowwolf</author><pubDate>Fri, 29 Aug 2014 23:06:47 +0800</pubDate><description><![CDATA[Combination Sum
 Total Accepted: 17172 Total
 Submissions: 64746My Submissions




Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where
 the ca]]></description><category></category></item><item><title><![CDATA[【LeetCode】Reverse Linked List II]]></title><link>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38637825</link><guid>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38637825</guid><author>chinasnowwolf</author><pubDate>Sun, 17 Aug 2014 11:40:35 +0800</pubDate><description><![CDATA[Reverse Linked List II
 Total Accepted: 15366 Total
 Submissions: 59341My Submissions




Reverse a linked list from position m to n. Do it in-place and in one-pass.
For example:
Given 1->2->]]></description><category></category></item><item><title><![CDATA[【LeetCode】Convert Sorted List to Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38637805</link><guid>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38637805</guid><author>chinasnowwolf</author><pubDate>Sun, 17 Aug 2014 11:36:45 +0800</pubDate><description><![CDATA[Convert Sorted List to Binary Search Tree
 Total Accepted: 16035 Total
 Submissions: 59053My Submissions




Given a singly linked list where elements are sorted in ascending order, convert it ]]></description><category></category></item><item><title><![CDATA[【LeetCode】Partition List]]></title><link>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38622919</link><guid>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38622919</guid><author>chinasnowwolf</author><pubDate>Sat, 16 Aug 2014 23:42:07 +0800</pubDate><description><![CDATA[Partition List
 Total Accepted: 14597 Total
 Submissions: 54894My Submissions




Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than ]]></description><category></category></item><item><title><![CDATA[【LeetCode】Remove Duplicates from Sorted List & Remove Duplicates from Sorted List II]]></title><link>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38597743</link><guid>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38597743</guid><author>chinasnowwolf</author><pubDate>Sat, 16 Aug 2014 00:01:36 +0800</pubDate><description><![CDATA[Remove Duplicates from Sorted List
 Total Accepted: 22211 Total
 Submissions: 63769My Submissions




Given a sorted linked list, delete all duplicates such that each element appear only once.]]></description><category></category></item><item><title><![CDATA[【LeetCode】Merge Two Sorted Lists & Merge k Sorted Lists]]></title><link>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38595849</link><guid>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38595849</guid><author>chinasnowwolf</author><pubDate>Fri, 15 Aug 2014 23:03:58 +0800</pubDate><description><![CDATA[Merge Two Sorted Lists
 Total Accepted: 20769 Total
 Submissions: 62658My Submissions




Merge two sorted linked lists and return it as a new list. The new list should be made by splicing toge]]></description><category></category></item><item><title><![CDATA[【LeetCode】 Rotate List]]></title><link>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38593105</link><guid>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38593105</guid><author>chinasnowwolf</author><pubDate>Fri, 15 Aug 2014 22:36:27 +0800</pubDate><description><![CDATA[Rotate List
 Total Accepted: 13773 Total
 Submissions: 62790My Submissions




Given a list, rotate the list to the right by k places, where k is non-negative.
For example:
Given 1->2->3->4->]]></description><category></category></item><item><title><![CDATA[【LeetCode】Remove Nth Node From End of List]]></title><link>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38565303</link><guid>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38565303</guid><author>chinasnowwolf</author><pubDate>Thu, 14 Aug 2014 22:22:17 +0800</pubDate><description><![CDATA[Remove Nth Node From End of List
 Total Accepted: 17965 Total
 Submissions: 60372My Submissions




Given a linked list, remove the nth node from the end of list and return its head.
For examp]]></description><category></category></item><item><title><![CDATA[【LeetCode】Flatten Binary Tree to Linked List]]></title><link>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38502547</link><guid>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38502547</guid><author>chinasnowwolf</author><pubDate>Mon, 11 Aug 2014 23:24:12 +0800</pubDate><description><![CDATA[Flatten Binary Tree to Linked List
 Total Accepted: 18516 Total
 Submissions: 66328My Submissions




Given a binary tree, flatten it to a linked list in-place.
For example,
Given
         1]]></description><category></category></item><item><title><![CDATA[【LeetCode】Copy List with Random Pointer]]></title><link>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38502085</link><guid>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38502085</guid><author>chinasnowwolf</author><pubDate>Mon, 11 Aug 2014 22:53:43 +0800</pubDate><description><![CDATA[Copy List with Random Pointer
 Total Accepted: 16149 Total
 Submissions: 70123My Submissions




A linked list is given such that each node contains an additional random pointer which could poi]]></description><category></category></item><item><title><![CDATA[【LeetCode】Reverse Words in a String]]></title><link>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38376721</link><guid>https://blog.youkuaiyun.com/chinasnowwolf/article/details/38376721</guid><author>chinasnowwolf</author><pubDate>Mon, 04 Aug 2014 22:54:32 +0800</pubDate><description><![CDATA[Reverse Words in a String
 Total Accepted: 24045 Total
 Submissions: 171847My Submissions




Given an input string, reverse the string word by word.
For example,
Given s = "the sky is blue",]]></description><category></category></item><item><title><![CDATA[【LeetCode】Maximal Rectangle]]></title><link>https://blog.youkuaiyun.com/chinasnowwolf/article/details/37384767</link><guid>https://blog.youkuaiyun.com/chinasnowwolf/article/details/37384767</guid><author>chinasnowwolf</author><pubDate>Sun, 06 Jul 2014 21:56:22 +0800</pubDate><description><![CDATA[参考链接

http://blog.youkuaiyun.com/littlestream9527/article/details/19641013



题目描述


题目分析



总结


代码示例








推荐学习C++的资料
C++标准函数库
http://download.youkuaiyun.com/detail/chinasnowwolf/71]]></description><category></category></item><item><title><![CDATA[【LeetCode】Longest Consecutive Sequence]]></title><link>https://blog.youkuaiyun.com/chinasnowwolf/article/details/32322219</link><guid>https://blog.youkuaiyun.com/chinasnowwolf/article/details/32322219</guid><author>chinasnowwolf</author><pubDate>Thu, 19 Jun 2014 13:04:44 +0800</pubDate><description><![CDATA[参考链接





题目描述


题目分析



总结


代码示例








推荐学习C++的资料
C++标准函数库
http://download.youkuaiyun.com/detail/chinasnowwolf/7108919

在线C++API查询
http://www.cplusplus.com/
map使用方法

htt]]></description><category></category></item><item><title><![CDATA[【leetcode】Largest Rectangle in Histogram]]></title><link>https://blog.youkuaiyun.com/chinasnowwolf/article/details/32319379</link><guid>https://blog.youkuaiyun.com/chinasnowwolf/article/details/32319379</guid><author>chinasnowwolf</author><pubDate>Thu, 19 Jun 2014 11:39:31 +0800</pubDate><description><![CDATA[参考链接





题目描述


题目分析



总结


代码示例








推荐学习C++的资料
C++标准函数库
http://download.youkuaiyun.com/detail/chinasnowwolf/7108919

在线C++API查询
http://www.cplusplus.com/
map使用方法

htt]]></description><category></category></item><item><title><![CDATA[十道海量数据处理面试题与十个方法大总结]]></title><link>https://blog.youkuaiyun.com/chinasnowwolf/article/details/30088733</link><guid>https://blog.youkuaiyun.com/chinasnowwolf/article/details/30088733</guid><author>chinasnowwolf</author><pubDate>Wed, 11 Jun 2014 18:57:10 +0800</pubDate><description><![CDATA[原文http://blog.youkuaiyun.com/v_july_v/article/details/6279498]]></description><category></category></item><item><title><![CDATA[教你如何迅速秒杀掉：99%的海量数据处理面试题]]></title><link>https://blog.youkuaiyun.com/chinasnowwolf/article/details/30088439</link><guid>https://blog.youkuaiyun.com/chinasnowwolf/article/details/30088439</guid><author>chinasnowwolf</author><pubDate>Wed, 11 Jun 2014 18:55:16 +0800</pubDate><description><![CDATA[原文出处：http://blog.youkuaiyun.com/v_july_v/article/details/7382693]]></description><category></category></item><item><title><![CDATA[【LeetCode】Word Search]]></title><link>https://blog.youkuaiyun.com/chinasnowwolf/article/details/29190591</link><guid>https://blog.youkuaiyun.com/chinasnowwolf/article/details/29190591</guid><author>chinasnowwolf</author><pubDate>Sat, 07 Jun 2014 14:26:45 +0800</pubDate><description><![CDATA[参考链接





题目描述


题目分析



总结


代码示例








推荐学习C++的资料
C++标准函数库
http://download.youkuaiyun.com/detail/chinasnowwolf/7108919

在线C++API查询
http://www.cplusplus.com/
map使用方法

htt]]></description><category></category></item><item><title><![CDATA[面试时需要马上就能默写出函数]]></title><link>https://blog.youkuaiyun.com/chinasnowwolf/article/details/27694801</link><guid>https://blog.youkuaiyun.com/chinasnowwolf/article/details/27694801</guid><author>chinasnowwolf</author><pubDate>Fri, 30 May 2014 16:56:55 +0800</pubDate><description><![CDATA[/*
编译环境CFree 5.0
博客地址：http://blog.youkuaiyun.com/Snowwolf_Yang
需要能够快速默写的函数 
*/

#include 
#include 
using namespace std;
//************************************二分查找 
//输入为升序 
int binarySearch(int a[], int n,]]></description><category></category></item><item><title><![CDATA[删除K个数字，使剩下的数字串最大]]></title><link>https://blog.youkuaiyun.com/chinasnowwolf/article/details/27531829</link><guid>https://blog.youkuaiyun.com/chinasnowwolf/article/details/27531829</guid><author>chinasnowwolf</author><pubDate>Thu, 29 May 2014 15:05:29 +0800</pubDate><description><![CDATA[题目：

一个n位的数，去掉其中的k位，问怎样去掉使得留下来的那个（n-k）位的数最大？


分析：

可以直接用贪心来求解，每次寻找从头开始的连续递减序列，删除递减序列的最后一个元素，重复K次，最后剩下的数字串组成的数字最大。

比如：

“13787323”
第一次，递减序列只有1，删除1，得到3787323
第二次，递减序列只有3，删除3，得到787323
第三次]]></description><category></category></item><item><title><![CDATA[【LeetCode】Merge Intervals && Insert Interval]]></title><link>https://blog.youkuaiyun.com/chinasnowwolf/article/details/27523971</link><guid>https://blog.youkuaiyun.com/chinasnowwolf/article/details/27523971</guid><author>chinasnowwolf</author><pubDate>Thu, 29 May 2014 14:09:56 +0800</pubDate><description><![CDATA[参考链接





题目描述


题目分析



总结


代码示例








推荐学习C++的资料
C++标准函数库
http://download.youkuaiyun.com/detail/chinasnowwolf/7108919

在线C++API查询
http://www.cplusplus.com/
map使用方法

htt]]></description><category></category></item></channel></rss>