<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/newchan</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; newchan]]></copyright><item><title><![CDATA[腾讯内部技术文档：Netty+Nginx+Redis实战笔记（壹）]]></title><link>https://blog.youkuaiyun.com/newchan/article/details/109825253</link><guid>https://blog.youkuaiyun.com/newchan/article/details/109825253</guid><author>newchan</author><pubDate>Thu, 19 Nov 2020 20:48:49 +0800</pubDate><description><![CDATA[现代互联网架构，分布式系统是一个绕不开的话题。一款优秀的网络通信框架将在分布式系统的构建中起到举足轻重的作用。其中，特别出名的有 SUN 公司的 Grizzly 框架、JBoss 的 XIO、Apache 的 MINA 以及赫赫有名也是使用最广泛的 Netty 框架。
需要指出的是，网络通信框架的优秀不仅仅体现在性能和效率上，更重要的体现是，是否能够屏蔽底层复杂度，编程模型是否简单易懂，是否适用更多的应用场景，以及开发社区是否活跃。Netty 的成功正是很好地满足了上述的这几点。作为互联网从业人员，熟悉基于]]></description><category></category></item><item><title><![CDATA[UML图几种常见关系的总结]]></title><link>https://blog.youkuaiyun.com/newchan/article/details/39699217</link><guid>https://blog.youkuaiyun.com/newchan/article/details/39699217</guid><author>newchan</author><pubDate>Tue, 30 Sep 2014 19:47:33 +0800</pubDate><description><![CDATA[在UML类图中，常见的有以下几种关系: 泛化（Generalization）,  实现（Realization），关联（Association)，聚合（Aggregation），组合(Composition)，依赖(Dependency)

         1. 泛化（Generalization）

        【泛化关系】：是一种继承关系，表示一般与特殊的关系，它指定了子类如何特]]></description><category></category></item><item><title><![CDATA[Search Insert Position]]></title><link>https://blog.youkuaiyun.com/newchan/article/details/39558823</link><guid>https://blog.youkuaiyun.com/newchan/article/details/39558823</guid><author>newchan</author><pubDate>Thu, 25 Sep 2014 21:38:57 +0800</pubDate><description><![CDATA[Search Insert Position
 Total Accepted: 26622 Total
 Submissions: 76002My Submissions




Given a sorted array and a target value, return the index if the target is found. If not, return the in]]></description><category></category></item><item><title><![CDATA[Longest Substring Without Repeating Characters]]></title><link>https://blog.youkuaiyun.com/newchan/article/details/39482055</link><guid>https://blog.youkuaiyun.com/newchan/article/details/39482055</guid><author>newchan</author><pubDate>Mon, 22 Sep 2014 21:12:30 +0800</pubDate><description><![CDATA[Longest Substring Without Repeating Characters
 Total Accepted: 23601 Total
 Submissions: 105691My Submissions




Given a string, find the length of the longest substring without repeating cha]]></description><category></category></item><item><title><![CDATA[Two Sum]]></title><link>https://blog.youkuaiyun.com/newchan/article/details/39458463</link><guid>https://blog.youkuaiyun.com/newchan/article/details/39458463</guid><author>newchan</author><pubDate>Sun, 21 Sep 2014 23:14:32 +0800</pubDate><description><![CDATA[Two Sum
 Total Accepted: 33228 Total
 Submissions: 179382My Submissions




Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum ]]></description><category></category></item><item><title><![CDATA[TopCoder-BinaryCode-300]]></title><link>https://blog.youkuaiyun.com/newchan/article/details/39288597</link><guid>https://blog.youkuaiyun.com/newchan/article/details/39288597</guid><author>newchan</author><pubDate>Mon, 15 Sep 2014 09:32:35 +0800</pubDate><description><![CDATA[Problem Statement 



 

Let's say you have a binary string such as the following: 
011100011 
One way to encrypt this string is to add to each digit the sum of its adjacent digits. For exampl]]></description><category></category></item><item><title><![CDATA[Evaluate Reverse Polish Notation]]></title><link>https://blog.youkuaiyun.com/newchan/article/details/38943747</link><guid>https://blog.youkuaiyun.com/newchan/article/details/38943747</guid><author>newchan</author><pubDate>Sat, 30 Aug 2014 13:49:48 +0800</pubDate><description><![CDATA[Evaluate the value of an arithmetic expression in Reverse Polish Notation.

Valid operators are +, -, *, /.
 Each operand may be an integer or another expression.

Some examples:

  ["2", "1", ]]></description><category></category></item><item><title><![CDATA[Median of Two Sorted Arrays]]></title><link>https://blog.youkuaiyun.com/newchan/article/details/38796211</link><guid>https://blog.youkuaiyun.com/newchan/article/details/38796211</guid><author>newchan</author><pubDate>Sun, 24 Aug 2014 15:17:21 +0800</pubDate><description><![CDATA[There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time
 complexity should be O(log (m+n)).
代码：
//Median of Two Sorted Array]]></description><category></category></item><item><title><![CDATA[如何阅读科研论文]]></title><link>https://blog.youkuaiyun.com/newchan/article/details/38732505</link><guid>https://blog.youkuaiyun.com/newchan/article/details/38732505</guid><author>newchan</author><pubDate>Thu, 21 Aug 2014 16:45:04 +0800</pubDate><description><![CDATA[如何阅读科研论文

S. Keshav

滑铁卢大学大卫·切瑞顿计算机科学学院

加拿大安大略省滑铁卢市

keshav@uwaterloo.ca

1.引言

科研人员必须阅读论文的几个理由：为了会议或者学生审稿、为了在本领域中保持消息灵通、为了解新领域进行文献调研。一个典型的科研人员每年可能要花费几百小时去阅读论文。

学会有效地阅读论文是一项非常重要但是很少会有机]]></description><category></category></item><item><title><![CDATA[Reverse Integer]]></title><link>https://blog.youkuaiyun.com/newchan/article/details/38729719</link><guid>https://blog.youkuaiyun.com/newchan/article/details/38729719</guid><author>newchan</author><pubDate>Thu, 21 Aug 2014 14:41:28 +0800</pubDate><description><![CDATA[Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x = -123, return -321

click to show spoilers.

Have you thought about this?
Here are some good questions to ask before c]]></description><category></category></item><item><title><![CDATA[Single Number]]></title><link>https://blog.youkuaiyun.com/newchan/article/details/38729347</link><guid>https://blog.youkuaiyun.com/newchan/article/details/38729347</guid><author>newchan</author><pubDate>Thu, 21 Aug 2014 14:21:41 +0800</pubDate><description><![CDATA[My Submissions



Given an array of integers, every element appears twice except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement ]]></description><category></category></item><item><title><![CDATA[Reverse Words in a String]]></title><link>https://blog.youkuaiyun.com/newchan/article/details/38708431</link><guid>https://blog.youkuaiyun.com/newchan/article/details/38708431</guid><author>newchan</author><pubDate>Wed, 20 Aug 2014 16:44:17 +0800</pubDate><description><![CDATA[Given an input string, reverse the string word by word.

For example,
Given s = "the sky is blue",
return "blue is sky the".

click to show clarification.

Clarification:


What constitutes]]></description><category></category></item><item><title><![CDATA[题目1437：To Fill or Not to Fill]]></title><link>https://blog.youkuaiyun.com/newchan/article/details/38032015</link><guid>https://blog.youkuaiyun.com/newchan/article/details/38032015</guid><author>newchan</author><pubDate>Tue, 22 Jul 2014 08:50:59 +0800</pubDate><description><![CDATA[题目1437：To Fill or Not to Fill



时间限制：1 秒

内存限制：128 兆

特殊判题：否

提交：1040

解决：223



题目描述：

With highways available, driving a car from Hangzhou to any other city is easy. But since the]]></description><category></category></item><item><title><![CDATA[题目1098：字母统计]]></title><link>https://blog.youkuaiyun.com/newchan/article/details/38011923</link><guid>https://blog.youkuaiyun.com/newchan/article/details/38011923</guid><author>newchan</author><pubDate>Mon, 21 Jul 2014 10:26:52 +0800</pubDate><description><![CDATA[题目1098：字母统计



时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：3035

解决：1439



题目描述：

输入一行字符串，计算其中A-Z大写字母出现的次数


输入：

案例可能有多组，每个案例输入为一行字符串。


输出：

对每个案例按A-Z的顺序输出其中大写字母出现的次数。


样例输入：
D]]></description><category></category></item><item><title><![CDATA[题目1442：A sequence of numbers]]></title><link>https://blog.youkuaiyun.com/newchan/article/details/38011347</link><guid>https://blog.youkuaiyun.com/newchan/article/details/38011347</guid><author>newchan</author><pubDate>Mon, 21 Jul 2014 10:09:53 +0800</pubDate><description><![CDATA[题目1442：A sequence of numbers



时间限制：1 秒

内存限制：128 兆

特殊判题：否

提交：1396

解决：309



题目描述：

Xinlv wrote some sequences on the paper a long time ago, they might be arithmetic or geometric]]></description><category></category></item><item><title><![CDATA[题目1443：Tr A]]></title><link>https://blog.youkuaiyun.com/newchan/article/details/38010329</link><guid>https://blog.youkuaiyun.com/newchan/article/details/38010329</guid><author>newchan</author><pubDate>Mon, 21 Jul 2014 09:19:47 +0800</pubDate><description><![CDATA[题目1443：Tr A



时间限制：1 秒

内存限制：128 兆

特殊判题：否

提交：427

解决：257



题目描述：

A为一个方阵，则Tr A表示A的迹（就是主对角线上各项的和），现要求Tr(A^k)%9973。


输入：

数据的第一行是一个T，表示有T组数据。
每组数据的第一行有n(2 


输出：

对应每组数]]></description><category></category></item><item><title><![CDATA[题目1441：人见人爱 A ^ B]]></title><link>https://blog.youkuaiyun.com/newchan/article/details/37997529</link><guid>https://blog.youkuaiyun.com/newchan/article/details/37997529</guid><author>newchan</author><pubDate>Sun, 20 Jul 2014 22:09:22 +0800</pubDate><description><![CDATA[题目1441：人见人爱 A ^ B



时间限制：1 秒

内存限制：128 兆

特殊判题：否

提交：931

解决：726



题目描述：

求A^B的最后三位数表示的整数。说明：A^B的含义是“A的B次方”


输入：

输入数据包含多个测试实例，每个实例占一行，由两个正整数A和B组成（1


输出：

对于每个测试实例，请输出A]]></description><category></category></item><item><title><![CDATA[题目1008：最短路径问题]]></title><link>https://blog.youkuaiyun.com/newchan/article/details/37994447</link><guid>https://blog.youkuaiyun.com/newchan/article/details/37994447</guid><author>newchan</author><pubDate>Sun, 20 Jul 2014 17:27:38 +0800</pubDate><description><![CDATA[题目1008：最短路径问题



时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：5386

解决：1717



题目描述：
给你n个点，m条无向边，每条边都有长度d和花费p，给你起点s终点t，要求输出起点到终点的最短距离及其花费，如果最短距离有多条路线，则输出花费最少的。


输入：
输入n,m，点的编号是1~n,然后是m行，每行4个数]]></description><category></category></item><item><title><![CDATA[Dijkstra算法]]></title><link>https://blog.youkuaiyun.com/newchan/article/details/37992111</link><guid>https://blog.youkuaiyun.com/newchan/article/details/37992111</guid><author>newchan</author><pubDate>Sun, 20 Jul 2014 14:34:18 +0800</pubDate><description><![CDATA[一、引言 Introduction

对图G中的每一条边e都赋以一个实数w(e)，则G连同它边上的权称为赋权图。赋权图经常出现在图论的实际应用问题中，边上的权（Weight）可以表示各种实际意义，如在输送网络中，权可以表示两地的距离，可以表示运输的时间，还可以表示运输的费用等。许多最优化问题相当于在一个赋权图中找出某类具有最小（或最大）权的子图。例如，给出一个连接各城镇的铁路网，要找出一条给定]]></description><category></category></item><item><title><![CDATA[题目1447：最短路]]></title><link>https://blog.youkuaiyun.com/newchan/article/details/37991195</link><guid>https://blog.youkuaiyun.com/newchan/article/details/37991195</guid><author>newchan</author><pubDate>Sun, 20 Jul 2014 13:05:52 +0800</pubDate><description><![CDATA[题目1447：最短路



时间限制：1 秒

内存限制：128 兆

特殊判题：否

提交：1638

解决：793



题目描述：

在每年的校赛里，所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候，却是非常累的！所以现在他们想要寻找最短的从商店到赛场的路线，你可以帮助他们吗？


输入]]></description><category></category></item></channel></rss>