<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[wt8220321的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/wt8220321</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wt8220321]]></copyright><item><title><![CDATA[leetcode代码记录 232 Implement Queue using Stacks]]></title><link>https://blog.youkuaiyun.com/wt8220321/article/details/51822019</link><guid>https://blog.youkuaiyun.com/wt8220321/article/details/51822019</guid><author>wt8220321</author><pubDate>Mon, 04 Jul 2016 16:47:30 +0800</pubDate><description><![CDATA[题目如下：
232. Implement Queue using Stacks



Implement the following operations of a queue using stacks.

push(x) -- Push element x to the back of queue.pop() -- Removes the element from in front]]></description><category></category></item><item><title><![CDATA[LeetCode代码记录 24 Swap Nodes in Pairs]]></title><link>https://blog.youkuaiyun.com/wt8220321/article/details/51791785</link><guid>https://blog.youkuaiyun.com/wt8220321/article/details/51791785</guid><author>wt8220321</author><pubDate>Thu, 30 Jun 2016 17:03:08 +0800</pubDate><description><![CDATA[题目如下：


Given a linked list, swap every two adjacent nodes and return its head.

For example,
Given 1->2->3->4, you should return the list as 2->1->4->3.

Your algorithm should use only consta]]></description><category></category></item><item><title><![CDATA[C++相关经验]]></title><link>https://blog.youkuaiyun.com/wt8220321/article/details/40651487</link><guid>https://blog.youkuaiyun.com/wt8220321/article/details/40651487</guid><author>wt8220321</author><pubDate>Fri, 31 Oct 2014 11:13:00 +0800</pubDate><description><![CDATA[以下记录相关C++项目经验，]]></description><category></category></item><item><title><![CDATA[遇到VS需要重编译编译头的问题]]></title><link>https://blog.youkuaiyun.com/wt8220321/article/details/37650089</link><guid>https://blog.youkuaiyun.com/wt8220321/article/details/37650089</guid><author>wt8220321</author><pubDate>Thu, 10 Jul 2014 09:48:38 +0800</pubDate><description><![CDATA[设置地点在C/C++  预编译头 创建、使用yubia]]></description><category></category></item><item><title><![CDATA[双缓冲避免MFC图形闪烁（转）]]></title><link>https://blog.youkuaiyun.com/wt8220321/article/details/17442363</link><guid>https://blog.youkuaiyun.com/wt8220321/article/details/17442363</guid><author>wt8220321</author><pubDate>Fri, 20 Dec 2013 14:54:53 +0800</pubDate><description><![CDATA[MFC GDI双缓冲避免图形闪烁（转）

 
多数人认为MFC的绘图函数效率很低，总是想寻求其它的解决方案。MFC的绘
图效率的确不高但也不差，而且它的绘图函数使用非常简单，只要使用方法得当，
再加上一些技巧，用MFC可以得到效率很高的绘图程序。我想就我长期（呵呵
当然也只有2年多）使用MFC绘图的经验谈谈我的一些观点。
1、显示的图形为什么会闪烁？
我们的绘图过程大多放在OnDr]]></description><category></category></item><item><title><![CDATA[窗口消息的传递]]></title><link>https://blog.youkuaiyun.com/wt8220321/article/details/17436613</link><guid>https://blog.youkuaiyun.com/wt8220321/article/details/17436613</guid><author>wt8220321</author><pubDate>Fri, 20 Dec 2013 10:22:31 +0800</pubDate><description><![CDATA[声明：本文非本人所写，本文已经写在本人优快云博客里。本原来源于一篇英文文章的翻译。

        消息（Message）是窗口间通信的最重要的方式之一。传统的程序从main（）函数处开始一行一行的执行直到退出，但是窗口的概念则不同。窗口对事件（event）进行响应，这种事件称为消息。事件由程序本身、其他程序或系统程序产生，这些事件又产生消息。鼠标移动、按键等都会产生事件。消息分为两种即窗]]></description><category></category></item></channel></rss>