<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[XCS的Blog]]></title><description><![CDATA[技术小博客]]></description><link>https://blog.youkuaiyun.com/LGD_YYF</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; LGD_YYF]]></copyright><item><title><![CDATA[WebSocket 网页聊天室的实现（服务器端：.net + windows服务，前端：Html5）]]></title><link>https://blog.youkuaiyun.com/LGD_YYF/article/details/51889864</link><guid>https://blog.youkuaiyun.com/LGD_YYF/article/details/51889864</guid><author>LGD_YYF</author><pubDate>Tue, 12 Jul 2016 16:02:20 +0800</pubDate><description><![CDATA[websocket是html5中的比较有特色一块，它使得以往在客户端软件中常用的socket在web程序中也能轻松的使用，较大的提高了效率。废话不多说，直接进入题。网页聊天室包括2个部分，后端服务器+前端页面。 
1、后端服务部分：.net4.0 + windows服务。相比寄宿在iis中，寄宿在进程中的windows服务更加的稳定可靠（文章中的例子用windows控制台程序演示，后面给出完整的wi]]></description><category></category></item><item><title><![CDATA[[LeetCode] Find Minimum in Rotated Sorted Array II （包含递增和递减旋转，含有重复数字）]]></title><link>https://blog.youkuaiyun.com/LGD_YYF/article/details/40538549</link><guid>https://blog.youkuaiyun.com/LGD_YYF/article/details/40538549</guid><author>LGD_YYF</author><pubDate>Tue, 28 Oct 2014 12:36:59 +0800</pubDate><description><![CDATA[Follow up for "Find Minimum in Rotated Sorted Array":
What if duplicates are allowed?

Would this affect the run-time complexity? How and why?]]></description><category></category></item><item><title><![CDATA[[LeetCode] Find Minimum in Rotated Sorted Array （包含递增和递减旋转）]]></title><link>https://blog.youkuaiyun.com/LGD_YYF/article/details/40536943</link><guid>https://blog.youkuaiyun.com/LGD_YYF/article/details/40536943</guid><author>LGD_YYF</author><pubDate>Tue, 28 Oct 2014 10:41:09 +0800</pubDate><description><![CDATA[原题如下：

Suppose a sorted array is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4
 5 6 7 0 1 2).

Find the minimum element.

You may assume no duplicate e]]></description><category></category></item></channel></rss>