<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[zhaosdfa]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/zhaosdfa</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; zhaosdfa]]></copyright><item><title><![CDATA[LeetCode Sliding Window Maximum]]></title><link>https://blog.youkuaiyun.com/zhaosdfa/article/details/47704825</link><guid>https://blog.youkuaiyun.com/zhaosdfa/article/details/47704825</guid><author>zhaosdfa</author><pubDate>Sun, 16 Aug 2015 18:57:07 +0800</pubDate><description><![CDATA[Sliding Window Maximum题目DescriptionGiven an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the wind]]></description><category></category></item><item><title><![CDATA[LeetCode Search a 2D Matrix II]]></title><link>https://blog.youkuaiyun.com/zhaosdfa/article/details/47691697</link><guid>https://blog.youkuaiyun.com/zhaosdfa/article/details/47691697</guid><author>zhaosdfa</author><pubDate>Sun, 16 Aug 2015 00:57:39 +0800</pubDate><description><![CDATA[Search a 2D Matrix II题目DescriptionWrite an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted in ascending from l]]></description><category></category></item><item><title><![CDATA[LeetCode Different Ways to Add Parentheses]]></title><link>https://blog.youkuaiyun.com/zhaosdfa/article/details/47690279</link><guid>https://blog.youkuaiyun.com/zhaosdfa/article/details/47690279</guid><author>zhaosdfa</author><pubDate>Sun, 16 Aug 2015 00:29:19 +0800</pubDate><description><![CDATA[Different Ways to Add ParenthesesGiven a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators]]></description><category></category></item><item><title><![CDATA[设计模式 - 建造者模式（Builder） C++实现]]></title><link>https://blog.youkuaiyun.com/zhaosdfa/article/details/45392761</link><guid>https://blog.youkuaiyun.com/zhaosdfa/article/details/45392761</guid><author>zhaosdfa</author><pubDate>Sun, 21 Jun 2015 18:09:16 +0800</pubDate><description><![CDATA[生成器模式（Builder）
意图：将一个复杂对象的构建与它的表示分离，使得同样的构建过程可以创建不同的表示。]]></description><category></category></item><item><title><![CDATA[设计模式 - 抽象工厂模式（Abstract Factory） C++实现]]></title><link>https://blog.youkuaiyun.com/zhaosdfa/article/details/45219185</link><guid>https://blog.youkuaiyun.com/zhaosdfa/article/details/45219185</guid><author>zhaosdfa</author><pubDate>Thu, 23 Apr 2015 12:53:03 +0800</pubDate><description><![CDATA[抽象工厂模式（Abstract Factory）
意图：提供一个创建一系列相关或相互依赖对象的接口。
之前的工厂方法模式，每增加一个产品，就需要增加一个具体产品类和一个对于工厂类。
对于一些情况，比如设计一个UI库，有按钮、滚动条等组件，为了让程序更加个性化，需要实现程序可以换皮肤的功能，比如蓝色主题、红色主题等，而且要便于拓展新的主题。
如果用工厂方法模式来实现的话，对每个组件都要一个相]]></description><category></category></item><item><title><![CDATA[设计模式 - 工厂方法（Factory Method） C++实现]]></title><link>https://blog.youkuaiyun.com/zhaosdfa/article/details/45175705</link><guid>https://blog.youkuaiyun.com/zhaosdfa/article/details/45175705</guid><author>zhaosdfa</author><pubDate>Tue, 21 Apr 2015 21:36:49 +0800</pubDate><description><![CDATA[工厂方法（Factory Method）
意图：定义一个用于创建对象的接口，让子类决定实例化哪个类。解决简单工厂模式不支持开闭原则的缺点。
实现：


uml:








ps 发现了一个Linux下面画UML很好用的软件 astah （community版免费）]]></description><category></category></item><item><title><![CDATA[设计模式 - 简单工厂模式/静态工厂模式（Static Factory Method）  C++实现]]></title><link>https://blog.youkuaiyun.com/zhaosdfa/article/details/45170037</link><guid>https://blog.youkuaiyun.com/zhaosdfa/article/details/45170037</guid><author>zhaosdfa</author><pubDate>Tue, 21 Apr 2015 15:36:13 +0800</pubDate><description><![CDATA[简单工厂模式
简单工厂模式又叫静态工厂方法，不属于23种GOF模式之一。
适用场景：在程序的各个地方都需要new一些常用的对象，并且对new的对象要进行一些初始化，new操作散落在程序的各个地方，不便于管理和维护，因此引入简单工厂模式来统一管理常见对象的创建。
客户调用工厂的方法，得到需要的产品，无需自己创建产品。
工厂根据客户传入的参数或者配置文件来决定创建什么类型的产品。]]></description><category></category></item><item><title><![CDATA[设计模式 - 单例模式（Singleton） C++实现]]></title><link>https://blog.youkuaiyun.com/zhaosdfa/article/details/45073615</link><guid>https://blog.youkuaiyun.com/zhaosdfa/article/details/45073615</guid><author>zhaosdfa</author><pubDate>Mon, 20 Apr 2015 23:41:01 +0800</pubDate><description><![CDATA[创建型模式
单例模式（Singleton）
意图
工厂方法模式（Factory Method）
抽象工厂模式（Abstract Factory）
原型模式（Prototype）
生成器模式（Builder）]]></description><category></category></item><item><title><![CDATA[微软2016校园招聘在线笔试 - 第二题 Professor Q's Software]]></title><link>https://blog.youkuaiyun.com/zhaosdfa/article/details/44860825</link><guid>https://blog.youkuaiyun.com/zhaosdfa/article/details/44860825</guid><author>zhaosdfa</author><pubDate>Fri, 03 Apr 2015 22:39:42 +0800</pubDate><description><![CDATA[题目2 : Professor Q's Software




时间限制:10000ms
单点时限:1000ms
内存限制:256MB






描述
Professor Q develops a new software. The software consists of N modules which are numbered from 1 to N. The]]></description><category></category></item><item><title><![CDATA[微软2016校园招聘在线笔试题目－第一题　Magic Box]]></title><link>https://blog.youkuaiyun.com/zhaosdfa/article/details/44860641</link><guid>https://blog.youkuaiyun.com/zhaosdfa/article/details/44860641</guid><author>zhaosdfa</author><pubDate>Fri, 03 Apr 2015 22:13:12 +0800</pubDate><description><![CDATA[题目1 : Magic Box




时间限制:10000ms
单点时限:1000ms
内存限制:256MB






描述
The circus clown Sunny has a magic box. When the circus is performing, Sunny puts some balls into the box one by one. Th]]></description><category></category></item><item><title><![CDATA[C++知识点复习]]></title><link>https://blog.youkuaiyun.com/zhaosdfa/article/details/44130991</link><guid>https://blog.youkuaiyun.com/zhaosdfa/article/details/44130991</guid><author>zhaosdfa</author><pubDate>Sun, 08 Mar 2015 09:36:53 +0800</pubDate><description><![CDATA[static
static变量只能初始化一次：
#include 
#include 

using namespace std;

void fun(int i) {
    static int value = i;
    printf("%d\n", value);
}

int main() {
    
    fun(0);
    fun(1);
    fun(2);]]></description><category></category></item><item><title><![CDATA[UVa 10673 - Play with Floor and Ceil （扩展欧几里得）]]></title><link>https://blog.youkuaiyun.com/zhaosdfa/article/details/40374171</link><guid>https://blog.youkuaiyun.com/zhaosdfa/article/details/40374171</guid><author>zhaosdfa</author><pubDate>Wed, 22 Oct 2014 12:40:50 +0800</pubDate><description><![CDATA[UVA - 10673
Play with Floor and Ceil




Time Limit: 3000MS
Memory Limit: Unknown
64bit IO Format: %lld & %llu





Submit Status

Description


Problem A
Play with Floor and Ceil]]></description><category></category></item><item><title><![CDATA[UVa 10883 - Supermean （杨辉三角 通过取对数解决大数除大数）]]></title><link>https://blog.youkuaiyun.com/zhaosdfa/article/details/40304205</link><guid>https://blog.youkuaiyun.com/zhaosdfa/article/details/40304205</guid><author>zhaosdfa</author><pubDate>Mon, 20 Oct 2014 17:56:49 +0800</pubDate><description><![CDATA[UVA - 10883

Supermean




Time Limit: 3000MS
 
Memory Limit: Unknown
 
64bit IO Format: %lld & %llu




Submit Status


Description





Problem F
Supermean
Time Limit: 2 s]]></description><category></category></item><item><title><![CDATA[UVa 11038 - How Many O's? （组合数学 数位统计）]]></title><link>https://blog.youkuaiyun.com/zhaosdfa/article/details/40264503</link><guid>https://blog.youkuaiyun.com/zhaosdfa/article/details/40264503</guid><author>zhaosdfa</author><pubDate>Sun, 19 Oct 2014 17:56:27 +0800</pubDate><description><![CDATA[UVA - 11038

How Many O's?




Time Limit: 3000MS
 
Memory Limit: Unknown
 
64bit IO Format: %lld & %llu






Submit Status


Description



Problem E: How many 0's?
A Bened]]></description><category></category></item><item><title><![CDATA[HDU 4080 UVaLive 4513 - Stammering Aliens （字符串hash）]]></title><link>https://blog.youkuaiyun.com/zhaosdfa/article/details/40150567</link><guid>https://blog.youkuaiyun.com/zhaosdfa/article/details/40150567</guid><author>zhaosdfa</author><pubDate>Thu, 16 Oct 2014 16:57:07 +0800</pubDate><description><![CDATA[Stammering Aliens

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 745    Accepted Submission(s): 283



Problem Description

Dr. E]]></description><category></category></item><item><title><![CDATA[HDU 1890 UVaLive 3961 - Robotic Sort （Splay）]]></title><link>https://blog.youkuaiyun.com/zhaosdfa/article/details/40078649</link><guid>https://blog.youkuaiyun.com/zhaosdfa/article/details/40078649</guid><author>zhaosdfa</author><pubDate>Tue, 14 Oct 2014 16:19:10 +0800</pubDate><description><![CDATA[Robotic Sort

Time Limit: 6000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 2478    Accepted Submission(s): 1105



Problem Description

Somewhere]]></description><category></category></item><item><title><![CDATA[UVa 11922 - Permutation Transformer （Splay）]]></title><link>https://blog.youkuaiyun.com/zhaosdfa/article/details/40074613</link><guid>https://blog.youkuaiyun.com/zhaosdfa/article/details/40074613</guid><author>zhaosdfa</author><pubDate>Tue, 14 Oct 2014 11:47:32 +0800</pubDate><description><![CDATA[UVA - 11922

Permutation Transformer




Time Limit: 2000MS
 
Memory Limit: Unknown
 
64bit IO Format: %lld & %llu





[Submit]  
 [Go Back]   [Status]  


Description




]]></description><category></category></item><item><title><![CDATA[POJ 1890 - A Simple Problem with Integers （线段树 Splay）]]></title><link>https://blog.youkuaiyun.com/zhaosdfa/article/details/40052355</link><guid>https://blog.youkuaiyun.com/zhaosdfa/article/details/40052355</guid><author>zhaosdfa</author><pubDate>Mon, 13 Oct 2014 21:10:42 +0800</pubDate><description><![CDATA[A Simple Problem with Integers




Time Limit: 5000MS
 
Memory Limit: 131072K


Total Submissions: 64159
 
Accepted: 19757


Case Time Limit: 2000MS




Description

You have N i]]></description><category></category></item><item><title><![CDATA[UVaLive 4847 - Binary Search Tree （与BST有关的计数问题）]]></title><link>https://blog.youkuaiyun.com/zhaosdfa/article/details/39853421</link><guid>https://blog.youkuaiyun.com/zhaosdfa/article/details/39853421</guid><author>zhaosdfa</author><pubDate>Tue, 07 Oct 2014 13:24:25 +0800</pubDate><description><![CDATA[UVALive - 4847

Binary Search Tree




Time Limit: 3000MS
 
Memory Limit: Unknown
 
64bit IO Format: %lld & %llu





[Submit]  
 [Go Back]   [Status]  


Description



A bin]]></description><category></category></item><item><title><![CDATA[UVaLive 3490 - Generator （AC自动机 期望DP 高斯消元）]]></title><link>https://blog.youkuaiyun.com/zhaosdfa/article/details/39805331</link><guid>https://blog.youkuaiyun.com/zhaosdfa/article/details/39805331</guid><author>zhaosdfa</author><pubDate>Sun, 05 Oct 2014 20:16:17 +0800</pubDate><description><![CDATA[UVALive - 3490

Generator




Time Limit: 3000MS
 
Memory Limit: Unknown
 
64bit IO Format: %lld & %llu





[Submit]  
 [Go Back]   [Status]  


Description



We can generat]]></description><category></category></item></channel></rss>