<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[flyfuture1的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/flyfuture1</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; flyfuture1]]></copyright><item><title><![CDATA[CC++ 生成随机数]]></title><link>https://blog.youkuaiyun.com/flyfuture1/article/details/103931393</link><guid>https://blog.youkuaiyun.com/flyfuture1/article/details/103931393</guid><author>flyfuture1</author><pubDate>Fri, 10 Jan 2020 22:07:01 +0800</pubDate><description><![CDATA[C/C++ 生成随机数
1.生成随机数的范围为[0,RAND_MAX]
例如[1,10]。
#include &lt;cstdio&gt;
#include &lt;cstdlib&gt;
#include &lt;cmath&gt;
#include &lt;ctime&gt;
//RAND_MAX为stdlib.h文件中的一个常数，大小通常为32767
int main()
{
    sra...]]></description><category></category></item><item><title><![CDATA[PAT甲级 1001 A+B Format]]></title><link>https://blog.youkuaiyun.com/flyfuture1/article/details/103624453</link><guid>https://blog.youkuaiyun.com/flyfuture1/article/details/103624453</guid><author>flyfuture1</author><pubDate>Thu, 19 Dec 2019 22:20:55 +0800</pubDate><description><![CDATA[PAT甲级 1001 A+B Format
Calculate a+b and output the sum in standard format – that is, the digits must be separated into groups of three by commas (unless there are less than four digits).
Input Specifi...]]></description><category></category></item><item><title><![CDATA[LeetCode 1. Two Sum]]></title><link>https://blog.youkuaiyun.com/flyfuture1/article/details/103603441</link><guid>https://blog.youkuaiyun.com/flyfuture1/article/details/103603441</guid><author>flyfuture1</author><pubDate>Wed, 18 Dec 2019 19:39:13 +0800</pubDate><description><![CDATA[LeetCode 1. Two Sum
一.题目分析
1.要点：

each input would have exactly one solution
not use the same element twice

2.散列
定义：将元素通过一个函数转换为整型，使该整数可以尽量唯一的代表该元素
例如：
m[nums[i]] = i;//可以体现散列的思想，用空间换时间

散列为什么能够加快查找速...]]></description><category></category></item></channel></rss>