<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[打怪升级]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/u010620004</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u010620004]]></copyright><item><title><![CDATA[POJ1009:Edge Detection]]></title><link>https://blog.youkuaiyun.com/u010620004/article/details/78144811</link><guid>https://blog.youkuaiyun.com/u010620004/article/details/78144811</guid><author>u010620004</author><pubDate>Sat, 30 Sep 2017 18:48:36 +0800</pubDate><description><![CDATA[问题描述 
IONU Satellite Imaging, Inc. records and stores very large images using run length encoding. You are to write a program that reads a compressed image, finds the edges in the image, as described b]]></description><category></category></item><item><title><![CDATA[digit puzzle 数字谜 Uva12107]]></title><link>https://blog.youkuaiyun.com/u010620004/article/details/77930587</link><guid>https://blog.youkuaiyun.com/u010620004/article/details/77930587</guid><author>u010620004</author><pubDate>Mon, 11 Sep 2017 10:37:23 +0800</pubDate><description><![CDATA[题目digit puzzle 数字谜 Uva12107 
给一个不完整表达式，要求修改尽量少的数，使修改后的数字谜只有唯一解。空格和数字可以随意替换，但不能增删，表达式中所有涉及的数必须是没有前导零的正数。输入数字谜一定形如a*b=c，其中a、b、c分别最多有2、2、4位。用下划线表示未知数字。输入保证会有解，即有经过变换后肯定能有一个表达式有唯一解。如果有多个解，输出字典序最小的解, 下划线比数字]]></description><category></category></item><item><title><![CDATA[全排列、子集]]></title><link>https://blog.youkuaiyun.com/u010620004/article/details/77844468</link><guid>https://blog.youkuaiyun.com/u010620004/article/details/77844468</guid><author>u010620004</author><pubDate>Mon, 04 Sep 2017 22:43:28 +0800</pubDate><description><![CDATA[问题输出数组P[a,b,b,b]的全排列\全子集 ; 注意集合元素有重复测试#define N 4
char P[]={'a', 'b', 'b', 'c'}int main()
{
    int i, j, A[N];
    printf("全排列-递归\n");
    permutation1(N, A, 0);    printf("全排列-非递归\n");
    //用索引 转化数组]]></description><category></category></item><item><title><![CDATA[UVa 12569 - Planning mobile robot on Tree (EASY Version)]]></title><link>https://blog.youkuaiyun.com/u010620004/article/details/77828982</link><guid>https://blog.youkuaiyun.com/u010620004/article/details/77828982</guid><author>u010620004</author><pubDate>Mon, 04 Sep 2017 00:01:35 +0800</pubDate><description><![CDATA[问题一棵4<=n<=15个节点的数。其中一个节点上一个机器人 还有些节点有石头, 指定机器人的起点和终点、以及石头的起始位置，求机器人最终到达终点最小步数的方案, 多解时输出一个即可. 每次机器人或者石头只能移动到相邻的空节点上。 
eg: 有8个节点1\2\3\4\5\6\7\8 
从1 能到达 2\6\7 
从2 能到达 1\3\8 
从3 能到达 2\4 
从4 能到达 3\5开始2\3\4节]]></description><category></category></item><item><title><![CDATA[uva10384 The Wall Pusher 推门游戏]]></title><link>https://blog.youkuaiyun.com/u010620004/article/details/77828739</link><guid>https://blog.youkuaiyun.com/u010620004/article/details/77828739</guid><author>u010620004</author><pubDate>Sun, 03 Sep 2017 23:09:27 +0800</pubDate><description><![CDATA[问题从S出发,每次往东南西北四个方向前进。 如果前方有墙壁，游戏者可以往前推移一格。 如果有连续两堵墙（包含）以上的墙，或者是游戏区域边界上的墙  则推不动。 
求最少步数走出迷宫 4行6列，多解时任意输出一格移动序列即可思路
迷宫怎么存储 
用三元组表示一堵墙 
数组wallX[y][x1][x2] 表示第y＝y时 从x1与x2之间有一堵墙 
数组wallY[x][y1][y2] 表示第x＝x时]]></description><category></category></item><item><title><![CDATA[4093:倒排索引查询--bitmap并查集]]></title><link>https://blog.youkuaiyun.com/u010620004/article/details/77773832</link><guid>https://blog.youkuaiyun.com/u010620004/article/details/77773832</guid><author>u010620004</author><pubDate>Fri, 01 Sep 2017 15:38:04 +0800</pubDate><description><![CDATA[总时间限制:1000ms 内存限制: 131072kB 
描述 
    现在已经对一些文档求出了倒排索引，对于一些词得出了这些词在哪些文档中出现的列表。 
    要求对于倒排索引实现一些简单的查询，即查询某些词同时出现，或者有些词出现有些词不出现的文档有哪些。 
输入 
    第一行包含一个数N，1 <= N <= 100，表示倒排索引表的数目。 
    接下来N行，每行第一个数ci，表示这]]></description><category></category></item><item><title><![CDATA[欧几里德|扩展欧几里德]]></title><link>https://blog.youkuaiyun.com/u010620004/article/details/77528101</link><guid>https://blog.youkuaiyun.com/u010620004/article/details/77528101</guid><author>u010620004</author><pubDate>Thu, 24 Aug 2017 11:31:05 +0800</pubDate><description><![CDATA[1、欧几里德 – 求解最大公约数gcd(a,b) = gcd(bn+r, b) = gcd(a%b, b) = gcd(b, a%b)  假定 a>b;  a=bn+r;int gcd(int a, int b){
     return b ? gcd(b, a%b) : a;
}int gcd(int a , int b)
{
     int r;
     while(b!=0)]]></description><category></category></item><item><title><![CDATA[python3 模拟POST请求时 “Content-Type”指定编码会消失的问题]]></title><link>https://blog.youkuaiyun.com/u010620004/article/details/77061948</link><guid>https://blog.youkuaiyun.com/u010620004/article/details/77061948</guid><author>u010620004</author><pubDate>Thu, 10 Aug 2017 16:51:31 +0800</pubDate><description><![CDATA[HTTP请求  服务器默认GBK编码时  浏览器UTF-8编码  如果请求时不指定编码格式就会乱码 
python3  模拟POST请求时 “Content-Type”指定编码会消失的问题如下代码所示  
在外部指定的”Content-Type”=”application/x-www-form-urlencoded; charset=UTF-8”  但是用抓包后返现charset=UTF-8消失了变]]></description><category></category></item><item><title><![CDATA[OJ_4150]]></title><link>https://blog.youkuaiyun.com/u010620004/article/details/76996861</link><guid>https://blog.youkuaiyun.com/u010620004/article/details/76996861</guid><author>u010620004</author><pubDate>Wed, 09 Aug 2017 15:27:19 +0800</pubDate><description><![CDATA[题目总时间限制: 
    1000ms 
内存限制: 
    65536kB描述又到周末了，同学们陆陆续续开开心心的来到机房上机。jbr也不例外，但是他到的有点晚，发现有些机位上已经有同学正在做题，有些机位还空着。细心的jbr发现，一位同学来到机房，坐在机位i上，如果他的左右两边都空着，他将获得能力值a[i]；如果当他坐下时，左边或者右边已经有一个人在上机了，他将获得能力值b[i]；如果当他坐下]]></description><category></category></item><item><title><![CDATA[metaclass new init call]]></title><link>https://blog.youkuaiyun.com/u010620004/article/details/50786353</link><guid>https://blog.youkuaiyun.com/u010620004/article/details/50786353</guid><author>u010620004</author><pubDate>Thu, 03 Mar 2016 10:09:33 +0800</pubDate><description><![CDATA[什么是 metaclass ?

In object-oriented programming, a metaclass is a class whose instances are 
classes. Just as an ordinary class defines the behavior of certain objects, a
metaclass defines the beh]]></description><category></category></item><item><title><![CDATA[策略模式]]></title><link>https://blog.youkuaiyun.com/u010620004/article/details/50783600</link><guid>https://blog.youkuaiyun.com/u010620004/article/details/50783600</guid><author>u010620004</author><pubDate>Wed, 02 Mar 2016 22:04:04 +0800</pubDate><description><![CDATA[策略模式 定义算法簇，分别封装起来， 让他们之间可以互相替换，此模式让算法的变化对立与使用算法的客户#coding:utf-8class Duck:
    def __init__(self):
        self.fly_behavior = FlyNoWay()    # 把飞的动作托付给FlyBehavior对象的子类
    def perform_fly(self):]]></description><category></category></item><item><title><![CDATA[简单工厂、工厂模式、抽象工厂模式]]></title><link>https://blog.youkuaiyun.com/u010620004/article/details/50761510</link><guid>https://blog.youkuaiyun.com/u010620004/article/details/50761510</guid><author>u010620004</author><pubDate>Sun, 28 Feb 2016 20:23:32 +0800</pubDate><description><![CDATA[简单工厂其实不是一个设计模式，反而比较像是一种编程习惯产品基类Pizza， 子类 CheesePizza、 PepperoniPizza、ClamPizza、VeggiePizza 
顾客通过商店PizzaStore的order_pizza函数预订pizza。  
而pizza的生产依赖SimpleFactory， 通过SimpleFactory的create_pizza获取实际的pizza 。]]></description><category></category></item><item><title><![CDATA[单例模式]]></title><link>https://blog.youkuaiyun.com/u010620004/article/details/50760862</link><guid>https://blog.youkuaiyun.com/u010620004/article/details/50760862</guid><author>u010620004</author><pubDate>Sun, 28 Feb 2016 17:34:10 +0800</pubDate><description><![CDATA[print '----------------------方法1--------------------------'
# 方法1 通过重写__new__方法
class Singleton(object):
    def __new__(cls, *args, **kw):
        if not hasattr(cls, '_instance'):
            cls._in]]></description><category></category></item><item><title><![CDATA[观察者模式]]></title><link>https://blog.youkuaiyun.com/u010620004/article/details/50760486</link><guid>https://blog.youkuaiyun.com/u010620004/article/details/50760486</guid><author>u010620004</author><pubDate>Sun, 28 Feb 2016 16:16:10 +0800</pubDate><description><![CDATA[观察者模式  
    定义了对象之间的一对多依赖，当一个对象改变状态时，会通过调用notfity_observer函数通知所有的依赖者（即调用依赖者的update函数），就会实现依赖者的同步更新。 
 
图片来源http://www.cnblogs.com/jerryxing/archive/2013/01/23/2873526.html# coding:utf-8
# 观察者模式
class S]]></description><category></category></item><item><title><![CDATA[排序]]></title><link>https://blog.youkuaiyun.com/u010620004/article/details/50760179</link><guid>https://blog.youkuaiyun.com/u010620004/article/details/50760179</guid><author>u010620004</author><pubDate>Sun, 28 Feb 2016 15:21:25 +0800</pubDate><description><![CDATA[insert插入排序     最坏O(n2)O(n^2)平均O(n2)O(n^2)  
shell希尔排序(不稳定)      最坏O(n2)O(n^2) 
bubble冒泡排序    最坏O(n2)O(n^2)平均O(n2)O(n^2)  
merge归并排序  最坏O(nlg(n))O(nlg(n)) 平均O(nlg(n))O(nlg(n)) 
quick快速排序    最坏 O(nlg(n))]]></description><category></category></item><item><title><![CDATA[图]]></title><link>https://blog.youkuaiyun.com/u010620004/article/details/50756202</link><guid>https://blog.youkuaiyun.com/u010620004/article/details/50756202</guid><author>u010620004</author><pubDate>Sat, 27 Feb 2016 17:48:29 +0800</pubDate><description><![CDATA[class Graph(object):
    '''无向图, 邻接表'''
    def __init__(self, family=None):
        self.node_neighbors = {}    @property
    def nodes(self):
        '''所有顶点'''
        return self.node_neighbors.key]]></description><category></category></item><item><title><![CDATA[二叉树]]></title><link>https://blog.youkuaiyun.com/u010620004/article/details/50751896</link><guid>https://blog.youkuaiyun.com/u010620004/article/details/50751896</guid><author>u010620004</author><pubDate>Fri, 26 Feb 2016 18:33:25 +0800</pubDate><description><![CDATA[#coding:utf-8class TreeNode(object):
    def __init__(self, data, lchild=None, rchild=None):
        self.lchild = lchild
        self.rchild = rchild
        self.data = dataclass BTree:
    def __ini]]></description><category></category></item><item><title><![CDATA[双向链表]]></title><link>https://blog.youkuaiyun.com/u010620004/article/details/50730865</link><guid>https://blog.youkuaiyun.com/u010620004/article/details/50730865</guid><author>u010620004</author><pubDate>Wed, 24 Feb 2016 14:51:27 +0800</pubDate><description><![CDATA[#coding:utf-8class DoubleLinked:
    def __init__(self):
        self.DL = self.Node(None) # 哨兵    def insert(self, k):
        self.pprint()
        node = self.Node(k)
        p = self.DL
        tem]]></description><category></category></item><item><title><![CDATA[单链表]]></title><link>https://blog.youkuaiyun.com/u010620004/article/details/50730561</link><guid>https://blog.youkuaiyun.com/u010620004/article/details/50730561</guid><author>u010620004</author><pubDate>Wed, 24 Feb 2016 14:21:33 +0800</pubDate><description><![CDATA[闲着无聊，python单链表#coding:utf-8
class Linked:
    def __init__(self):
        self.L = None    def insert(self, k):
        self.pprint()
        node = self.Node(k)
        p = temp = self.L
        # 找到合]]></description><category></category></item><item><title><![CDATA[PE_26]]></title><link>https://blog.youkuaiyun.com/u010620004/article/details/50574896</link><guid>https://blog.youkuaiyun.com/u010620004/article/details/50574896</guid><author>u010620004</author><pubDate>Sun, 24 Jan 2016 19:22:05 +0800</pubDate><description><![CDATA[problem 26A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:1/2 =   0.5 
1/3 =   0.(3) 
1/4 =   0.25 
1/5 =   0.2 
1/6 =]]></description><category></category></item></channel></rss>