<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[退而结网]]></title><description><![CDATA[不再临渊羡鱼]]></description><link>https://blog.youkuaiyun.com/fanoluo</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; fanoluo]]></copyright><item><title><![CDATA[博客搬家]]></title><link>https://blog.youkuaiyun.com/fanoluo/article/details/50951131</link><guid>https://blog.youkuaiyun.com/fanoluo/article/details/50951131</guid><author>fanoluo</author><pubDate>Mon, 21 Mar 2016 22:57:46 +0800</pubDate><description><![CDATA[决定换个地方写博客了。
[我的简书博客地址] http://www.jianshu.com/users/00f160f2edca/latest_articles]]></description><category></category></item><item><title><![CDATA[[leetcode] Burst Balloons]]></title><link>https://blog.youkuaiyun.com/fanoluo/article/details/50734445</link><guid>https://blog.youkuaiyun.com/fanoluo/article/details/50734445</guid><author>fanoluo</author><pubDate>Thu, 25 Feb 2016 00:00:17 +0800</pubDate><description><![CDATA[题目描述：

Given n balloons, indexed from 0 to n-1.
 Each balloon is painted with a number on it represented by array nums. You
 are asked to burst all the balloons. If the you burst balloon i you wil]]></description><category></category></item><item><title><![CDATA[[leetcode] Divide and Conquer]]></title><link>https://blog.youkuaiyun.com/fanoluo/article/details/50734297</link><guid>https://blog.youkuaiyun.com/fanoluo/article/details/50734297</guid><author>fanoluo</author><pubDate>Wed, 24 Feb 2016 23:55:46 +0800</pubDate><description><![CDATA[下面简单聊聊leetcode中的两道类似的DC的题目。之所以来写博客，是因为它们的思路确实与以往遇到的简单的DC有所不同。


1. Count of range sum



Given an integer array nums,
 return the number of range sums that lie in [lower, upper] inclusive.
Ra]]></description><category></category></item><item><title><![CDATA[[leetcode] Implement Trie (Prefix Tree)]]></title><link>https://blog.youkuaiyun.com/fanoluo/article/details/49645059</link><guid>https://blog.youkuaiyun.com/fanoluo/article/details/49645059</guid><author>fanoluo</author><pubDate>Wed, 04 Nov 2015 22:37:48 +0800</pubDate><description><![CDATA[Problem Description:


Implement a trie with insert, search,
 and startsWith methods.

Note:
You may assume that all inputs are consist of lowercase letters a-z.
继续我的每天水题之路。
这是一道小的设计题，设计一个字典树]]></description><category></category></item><item><title><![CDATA[[leetcode] Isomorphic Strings]]></title><link>https://blog.youkuaiyun.com/fanoluo/article/details/49594431</link><guid>https://blog.youkuaiyun.com/fanoluo/article/details/49594431</guid><author>fanoluo</author><pubDate>Tue, 03 Nov 2015 00:24:36 +0800</pubDate><description><![CDATA[Problem Description:


Given two strings s and t, determine if they are isomorphic.

Two strings are isomorphic if the characters in s can be replaced to get t.

All occurrences of a character ]]></description><category></category></item><item><title><![CDATA[[leetcode] Summary of Linked List (1)]]></title><link>https://blog.youkuaiyun.com/fanoluo/article/details/49478079</link><guid>https://blog.youkuaiyun.com/fanoluo/article/details/49478079</guid><author>fanoluo</author><pubDate>Thu, 29 Oct 2015 22:01:04 +0800</pubDate><description><![CDATA[今天总结leetcode上那些与Linked List有关的题目。


1. Reverse Linked List
题目大意：将单链表反转（可以分别考虑递归和迭代的方式）
基本思路：
（1）递归方式，对于某个待反转的list，先递归调用函数得到list->next的反转，然后将list节点加到list->next节点之后即可。注意递归出口会返回反转后的链表的头指针，原始链表的头指针变]]></description><category></category></item><item><title><![CDATA[[leetcode] Summary of Bit Manipulation]]></title><link>https://blog.youkuaiyun.com/fanoluo/article/details/49456275</link><guid>https://blog.youkuaiyun.com/fanoluo/article/details/49456275</guid><author>fanoluo</author><pubDate>Wed, 28 Oct 2015 00:25:39 +0800</pubDate><description><![CDATA[今天刷了几道题，发现leetcode现在都有分类了，所以顺便把以前刷过的bit manipulation相关的题目都看了一遍，下面简单总结一下。
1. Single Number
题目大意：在给定的整数数组中，除了一个数字之外，其他数字都出现了两次，现让求出只出现一次的那个数字。
基本思想：遍历数组一次，将所有数字依次进行异或运算，结果即为所求的数字。因为其他数字都恰好出现了两次，异或得0。]]></description><category></category></item><item><title><![CDATA[[leetcode] Number of Islands]]></title><link>https://blog.youkuaiyun.com/fanoluo/article/details/49407965</link><guid>https://blog.youkuaiyun.com/fanoluo/article/details/49407965</guid><author>fanoluo</author><pubDate>Sun, 25 Oct 2015 23:04:55 +0800</pubDate><description><![CDATA[Problem Description:
Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vert]]></description><category></category></item><item><title><![CDATA[[leetcode] Binary Tree Right Side View]]></title><link>https://blog.youkuaiyun.com/fanoluo/article/details/49392197</link><guid>https://blog.youkuaiyun.com/fanoluo/article/details/49392197</guid><author>fanoluo</author><pubDate>Sun, 25 Oct 2015 01:32:54 +0800</pubDate><description><![CDATA[Problem Description:
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.

For example:
Given the followin]]></description><category></category></item><item><title><![CDATA[[leetcode] House Robber]]></title><link>https://blog.youkuaiyun.com/fanoluo/article/details/49369553</link><guid>https://blog.youkuaiyun.com/fanoluo/article/details/49369553</guid><author>fanoluo</author><pubDate>Sat, 24 Oct 2015 01:05:00 +0800</pubDate><description><![CDATA[Problem Description: 
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them]]></description><category></category></item><item><title><![CDATA[[leetcode] Rotate and Reverse]]></title><link>https://blog.youkuaiyun.com/fanoluo/article/details/49339773</link><guid>https://blog.youkuaiyun.com/fanoluo/article/details/49339773</guid><author>fanoluo</author><pubDate>Thu, 22 Oct 2015 22:38:28 +0800</pubDate><description><![CDATA[今天刷了两道比较简单的题目，恰好都与reverse有关，所以就一起简单说说了。
（1）字符串的反转。“abcd”反转后变成“dcba”，这是最最基础的reverse了，也有文章分享过多种方法。但基本思路都差不多，就是依次把第一个元素与倒数第一个交换，第二个与倒数第二个交换，...，直至第n/2个为止。
（2）Reverse Integer。将整数反转，如123变成321。可以把整数转换成字符串]]></description><category></category></item><item><title><![CDATA[[leetcode] Best Time to Buy and Sell Stock IV]]></title><link>https://blog.youkuaiyun.com/fanoluo/article/details/49285265</link><guid>https://blog.youkuaiyun.com/fanoluo/article/details/49285265</guid><author>fanoluo</author><pubDate>Tue, 20 Oct 2015 23:50:23 +0800</pubDate><description><![CDATA[Problem Description:


Say you have an array for which the ith element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete at most k transact]]></description><category></category></item><item><title><![CDATA[[leetcode] Repeated DNA Sequences]]></title><link>https://blog.youkuaiyun.com/fanoluo/article/details/49256057</link><guid>https://blog.youkuaiyun.com/fanoluo/article/details/49256057</guid><author>fanoluo</author><pubDate>Mon, 19 Oct 2015 22:53:11 +0800</pubDate><description><![CDATA[Problem Description: 


All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is sometimes useful to identify repeated seque]]></description><category></category></item><item><title><![CDATA[[leetcode] Largest Number]]></title><link>https://blog.youkuaiyun.com/fanoluo/article/details/49234059</link><guid>https://blog.youkuaiyun.com/fanoluo/article/details/49234059</guid><author>fanoluo</author><pubDate>Mon, 19 Oct 2015 00:26:33 +0800</pubDate><description><![CDATA[Problem Description:


Given a list of non negative integers, arrange them such that they form the largest number.

For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330.

]]></description><category></category></item><item><title><![CDATA[硕士学位论文多级标题编号与图表编号]]></title><link>https://blog.youkuaiyun.com/fanoluo/article/details/45201237</link><guid>https://blog.youkuaiyun.com/fanoluo/article/details/45201237</guid><author>fanoluo</author><pubDate>Wed, 22 Apr 2015 22:12:45 +0800</pubDate><description><![CDATA[尽管自己对word并不陌生，但是折腾起硕士学位论文来还是费了九牛二虎之力才明白这些，下面就自己遇到的问题，说说一些疑难问题的解决方案。


1. 多级标题编号的问题
由于我们的学位论文要求章节按照汉语数字“一、二、三...”来编号，其他小标题则依旧是"1.1, 1.2, ...1.2.1, ..."这种编号，而直接运用word中的多级标题编号会出现“一.1”这种异类。
所以，如何实现这种]]></description><category></category></item><item><title><![CDATA[Yale开放课程博弈论24]]></title><link>https://blog.youkuaiyun.com/fanoluo/article/details/44729105</link><guid>https://blog.youkuaiyun.com/fanoluo/article/details/44729105</guid><author>fanoluo</author><pubDate>Sun, 29 Mar 2015 18:40:08 +0800</pubDate><description><![CDATA[24. 拍卖和获奖者的诅咒（最后一节课）

在之前所讲的博弈中，我们都知道对手是什么样的人，双方的收益如何。这节所讲的不一样的是，未知对手收益的博弈。如拍卖，在竞争被拍卖的商品时，你不知道别人认为被拍卖的商品的价值。

关于拍卖，一个极端是它具有公共价值V，另一个极端是私人价值Vi。其中公共价值表示，被出售商品的价格对所有的人来说都是一样的，如油井的开采权。而私人价值，表示每个人认为的价值]]></description><category></category></item><item><title><![CDATA[Yale开放课程博弈论23]]></title><link>https://blog.youkuaiyun.com/fanoluo/article/details/44522295</link><guid>https://blog.youkuaiyun.com/fanoluo/article/details/44522295</guid><author>fanoluo</author><pubDate>Sat, 21 Mar 2015 21:17:46 +0800</pubDate><description><![CDATA[23. 沉默，信令和苦难教育


1. 信息能够被证实的情况


我们来重新看看古诺博弈，有两家企业A和B竞争同一产品的产量，假设对于B，边际成本是Cm，企业A有三种情况：Ch（比Cm更高一点）、Cm、Cl（Cm-eps）。现在B的成本Cm是公开的，A有机会选择是否把自己的成本告诉B（无需任何额外开销）。

问题是，A是否应该告诉B自己的成本？

我们可以对照古诺曲线来分析这一]]></description><category></category></item><item><title><![CDATA[STL map内存释放的问题]]></title><link>https://blog.youkuaiyun.com/fanoluo/article/details/43611987</link><guid>https://blog.youkuaiyun.com/fanoluo/article/details/43611987</guid><author>fanoluo</author><pubDate>Sat, 07 Feb 2015 22:00:01 +0800</pubDate><description><![CDATA[今天在程序里面有这么一段糟糕的代码：
while()
     // cout << Memory1: 
     Type *a = new Type[MAX_N];
     // cout << Memory2: 
     map > m;
     for()
          m.insert(...);
     // cout << Memory3: 
     delete[]]></description><category></category></item><item><title><![CDATA[[Python]Windows下安装PIL遇到的问题]]></title><link>https://blog.youkuaiyun.com/fanoluo/article/details/42528169</link><guid>https://blog.youkuaiyun.com/fanoluo/article/details/42528169</guid><author>fanoluo</author><pubDate>Thu, 08 Jan 2015 18:37:09 +0800</pubDate><description><![CDATA[以下来说说艰难的安装PIL的过程，中途遇到一些问题，虽然网上很多类似的问题解答，可都是一样的只告诉很简单的“如何处理”一下就可以了，但是我就是完成不了这一步！


先介绍一下最终完成时我的环境，windows 7 64位系统、python 2.7.9 32位和Pillow-2.7.0.win32-py2.7。


首先，菜鸟学习PIL，直接按照廖雪峰老师的python教程上写的方法安装]]></description><category></category></item><item><title><![CDATA[[Python] collections — High-performance container datatypes]]></title><link>https://blog.youkuaiyun.com/fanoluo/article/details/42463915</link><guid>https://blog.youkuaiyun.com/fanoluo/article/details/42463915</guid><author>fanoluo</author><pubDate>Tue, 06 Jan 2015 19:44:38 +0800</pubDate><description><![CDATA[python中基础的数据结构除了str, int, float等超简单类型外，还提供了类似于C++中STL库里的一些较高级的数据结构，如tuple, list, dict和set。


而collections则是Python中内建的一个集合模块，提供了一些更加高级的集合类。


namedtuple (factory function for creating tuple subcl]]></description><category></category></item></channel></rss>