<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Ted's 游乐园]]></title><description><![CDATA[快乐编程，快乐生活~]]></description><link>https://blog.youkuaiyun.com/ACM_Ted</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ACM_Ted]]></copyright><item><title><![CDATA[新博客：http://tedhacker.top/]]></title><link>https://blog.youkuaiyun.com/ACM_Ted/article/details/52155100</link><guid>https://blog.youkuaiyun.com/ACM_Ted/article/details/52155100</guid><author>ACM_Ted</author><pubDate>Mon, 08 Aug 2016 20:13:38 +0800</pubDate><description><![CDATA[在github上开新博客啦，https://tedhacker.github.io/，新博客，新征途~]]></description><category></category></item><item><title><![CDATA[LeetCode OJ : Reverse Words in a String]]></title><link>https://blog.youkuaiyun.com/ACM_Ted/article/details/44515671</link><guid>https://blog.youkuaiyun.com/ACM_Ted/article/details/44515671</guid><author>ACM_Ted</author><pubDate>Sat, 21 Mar 2015 14:38:21 +0800</pubDate><description><![CDATA[Reverse Words in a String 

链接：https://leetcode.com/problems/reverse-words-in-a-string/

题解：

给你一个字符串"the sky is blue"，把单词顺序置反，变成"blue is sky the"。提示：For C programmers: Try to solve it in-place]]></description><category></category></item><item><title><![CDATA[LeetCode OJ : Remove Duplicates from Sorted Array]]></title><link>https://blog.youkuaiyun.com/ACM_Ted/article/details/44496509</link><guid>https://blog.youkuaiyun.com/ACM_Ted/article/details/44496509</guid><author>ACM_Ted</author><pubDate>Fri, 20 Mar 2015 20:09:09 +0800</pubDate><description><![CDATA[Remove Duplicates from Sorted Array 

链接：https://leetcode.com/problems/remove-duplicates-from-sorted-array/

题解：

给一个有序数组，让你除去重复的数字和除去后的长度。比如A=[1,1,2]，返回A=[1,2]，长度为2。要求使用常数空间。

维护两次指针a,b，a指向不重]]></description><category></category></item><item><title><![CDATA[LeetCode OJ : Median of Two Sorted Arrays]]></title><link>https://blog.youkuaiyun.com/ACM_Ted/article/details/44488325</link><guid>https://blog.youkuaiyun.com/ACM_Ted/article/details/44488325</guid><author>ACM_Ted</author><pubDate>Fri, 20 Mar 2015 10:55:24 +0800</pubDate><description><![CDATA[Median of Two Sorted Arrays 

链接：https://leetcode.com/problems/median-of-two-sorted-arrays/

题解：

给两个有序数组A,B，求中位数，要求时间复杂度为O(log (m+n))。

先求中位数的位置idx=(A.length+B.length)/2，分别比较两个数组的最小值哪个最小，弹出那个]]></description><category></category></item><item><title><![CDATA[LeetCode OJ : Maximum Gap]]></title><link>https://blog.youkuaiyun.com/ACM_Ted/article/details/44458121</link><guid>https://blog.youkuaiyun.com/ACM_Ted/article/details/44458121</guid><author>ACM_Ted</author><pubDate>Thu, 19 Mar 2015 15:15:44 +0800</pubDate><description><![CDATA[Maximum Gap

链接：https://leetcode.com/problems/maximum-gap/

题解：

本题给你一个无序的数列，问在排序中相邻两数之差的最大值是多少，要求线性时间复杂度。

因为通常的排序都O(nlog2n)，所以这里有选一些独特的办法。

观察可知，相邻两数之差最小是bucketLen=(max-min)/(len-1)[可以想象一个]]></description><category></category></item><item><title><![CDATA[LeetCode OJ : Gas Station]]></title><link>https://blog.youkuaiyun.com/ACM_Ted/article/details/44340177</link><guid>https://blog.youkuaiyun.com/ACM_Ted/article/details/44340177</guid><author>ACM_Ted</author><pubDate>Tue, 17 Mar 2015 13:13:29 +0800</pubDate><description><![CDATA[Roman to Integer

链接：https://leetcode.com/problems/gas-station/

题解：

本题提供两个数组int[] gas, int[] cost，gas表示第i个点的汽油量，cost表示从i到i+1所需的汽油量，问能否以空车从任一点出发，驶过所有点(路径是环)。

题解的思路大致是枚举，从0开始枚举能否从这个点出发走完全程，但是]]></description><category></category></item><item><title><![CDATA[LeetCode OJ : Roman to Integer]]></title><link>https://blog.youkuaiyun.com/ACM_Ted/article/details/44280409</link><guid>https://blog.youkuaiyun.com/ACM_Ted/article/details/44280409</guid><author>ACM_Ted</author><pubDate>Sun, 15 Mar 2015 20:43:00 +0800</pubDate><description><![CDATA[Roman to Integer

链接：https://leetcode.com/problems/roman-to-integer/

解答：

这题主要要了解罗马数字的规则

基本字符    相应的阿拉伯数字表示为
I                 1
V                5
X                10
L]]></description><category></category></item><item><title><![CDATA[PAT Advanced Level (1081~1087)]]></title><link>https://blog.youkuaiyun.com/ACM_Ted/article/details/41454577</link><guid>https://blog.youkuaiyun.com/ACM_Ted/article/details/41454577</guid><author>ACM_Ted</author><pubDate>Mon, 24 Nov 2014 21:53:58 +0800</pubDate><description><![CDATA[PAT 1081 

链接：http://www.patest.cn/contests/pat-a-practise/1077

代码：]]></description><category></category></item><item><title><![CDATA[PAT  Advanced Level (1077~1080)]]></title><link>https://blog.youkuaiyun.com/ACM_Ted/article/details/41450423</link><guid>https://blog.youkuaiyun.com/ACM_Ted/article/details/41450423</guid><author>ACM_Ted</author><pubDate>Mon, 24 Nov 2014 19:49:55 +0800</pubDate><description><![CDATA[PAT 1026 程序运行时间

链接：:http://www.patest.cn/contests/pat-b-practise/1026

代码：









PAT 1026 程序运行时间

链接：:http://www.patest.cn/contests/pat-b-practise/1026

代码：]]></description><category></category></item><item><title><![CDATA[PAT Basic Level (1026~1030)]]></title><link>https://blog.youkuaiyun.com/ACM_Ted/article/details/41419397</link><guid>https://blog.youkuaiyun.com/ACM_Ted/article/details/41419397</guid><author>ACM_Ted</author><pubDate>Sun, 23 Nov 2014 22:14:41 +0800</pubDate><description><![CDATA[PAT 1026
地址:http://www.patest.cn/contests/pat-b-practise/1026]]></description><category></category></item><item><title><![CDATA[Codeforces Round #260 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/ACM_Ted/article/details/38454865</link><guid>https://blog.youkuaiyun.com/ACM_Ted/article/details/38454865</guid><author>ACM_Ted</author><pubDate>Sat, 09 Aug 2014 11:38:52 +0800</pubDate><description><![CDATA[第一题：Dice Tower

题意：给你n个骰子，一个叠在一个上面，连接位置的两个面是两个不同的数字，问只告诉你最上面一个骰子的顶面和所有骰子面向你的两个面的数字，能否确定所有骰子每个面是什么数字？

题解：

代码：]]></description><category></category></item><item><title><![CDATA[PAT 1072. Gas Station]]></title><link>https://blog.youkuaiyun.com/ACM_Ted/article/details/20881645</link><guid>https://blog.youkuaiyun.com/ACM_Ted/article/details/20881645</guid><author>ACM_Ted</author><pubDate>Mon, 10 Mar 2014 01:34:10 +0800</pubDate><description><![CDATA[题目：http://pat.zju.edu.cn/contests/pat-a-practise/1072
题解：
对每个加油站进行迪杰斯特拉处理，求出最小距离和平均距离，再按题目要求排序输出。
代码：
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
usin]]></description><category></category></item><item><title><![CDATA[PAT 1066. Root of AVL Tree]]></title><link>https://blog.youkuaiyun.com/ACM_Ted/article/details/20855913</link><guid>https://blog.youkuaiyun.com/ACM_Ted/article/details/20855913</guid><author>ACM_Ted</author><pubDate>Sun, 09 Mar 2014 18:58:32 +0800</pubDate><description><![CDATA[题目：http://pat.zju.edu.cn/contests/pat-a-practise/1066
题解：
考察数据结构;AVL树。
重点就是四种情况的识别和处理。
代码：
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespac]]></description><category></category></item><item><title><![CDATA[PAT 1076. Forwards on Weibo]]></title><link>https://blog.youkuaiyun.com/ACM_Ted/article/details/20815231</link><guid>https://blog.youkuaiyun.com/ACM_Ted/article/details/20815231</guid><author>ACM_Ted</author><pubDate>Sun, 09 Mar 2014 02:14:21 +0800</pubDate><description><![CDATA[题目：http://pat.zju.edu.cn/contests/pat-a-practise/1076
题解：
共有n个微博号，第i行表明有k个人关注i，问x再转发m层的范围内可以转发多少人的微博(同1个人的微博算1个)。
依照输入建图。
对每个账号进行BFS。
代码：
#include
#include
#include
#include
#include
#include
#i]]></description><category></category></item><item><title><![CDATA[PAT 1068. Find More Coins]]></title><link>https://blog.youkuaiyun.com/ACM_Ted/article/details/20809579</link><guid>https://blog.youkuaiyun.com/ACM_Ted/article/details/20809579</guid><author>ACM_Ted</author><pubDate>Sun, 09 Mar 2014 00:35:14 +0800</pubDate><description><![CDATA[题目：http://pat.zju.edu.cn/contests/pat-a-practise/1068
题解：
背包。
代码：
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
#define INF 0x6ffff]]></description><category></category></item><item><title><![CDATA[PAT 1057. Stack]]></title><link>https://blog.youkuaiyun.com/ACM_Ted/article/details/20804993</link><guid>https://blog.youkuaiyun.com/ACM_Ted/article/details/20804993</guid><author>ACM_Ted</author><pubDate>Sat, 08 Mar 2014 23:21:59 +0800</pubDate><description><![CDATA[题目：http://pat.zju.edu.cn/contests/pat-a-practise/1057
题解：
维护一个小于等于mid的，一个大于mid的两部分，保持小的的大小和大的的大小一致或者比大的多一个，这样mid即小的的最后一个数。
代码：
#include
#include
#include
#include
#include
#include
#include
#inclu]]></description><category></category></item><item><title><![CDATA[PAT 1053. Path of Equal Weight]]></title><link>https://blog.youkuaiyun.com/ACM_Ted/article/details/20801651</link><guid>https://blog.youkuaiyun.com/ACM_Ted/article/details/20801651</guid><author>ACM_Ted</author><pubDate>Sat, 08 Mar 2014 22:13:07 +0800</pubDate><description><![CDATA[题目：http://pat.zju.edu.cn/contests/pat-a-practise/1053
题解：
给一棵树和各个树结点的权重，问哪些从根到叶子的权重和等于K。
深搜枚举所有可能即可。
代码：
#include
#include
#include
#include
#include
#include
#include
#include
#include
using nam]]></description><category></category></item><item><title><![CDATA[PAT 1034. Head of a Gang]]></title><link>https://blog.youkuaiyun.com/ACM_Ted/article/details/20789637</link><guid>https://blog.youkuaiyun.com/ACM_Ted/article/details/20789637</guid><author>ACM_Ted</author><pubDate>Sat, 08 Mar 2014 17:33:57 +0800</pubDate><description><![CDATA[题目：http://pat.zju.edu.cn/contests/pat-a-practise/1034
题解：
代码：
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
#define INF 0x6fffffff
map weight]]></description><category></category></item><item><title><![CDATA[PAT 1075. PAT Judge]]></title><link>https://blog.youkuaiyun.com/ACM_Ted/article/details/20743885</link><guid>https://blog.youkuaiyun.com/ACM_Ted/article/details/20743885</guid><author>ACM_Ted</author><pubDate>Fri, 07 Mar 2014 23:59:38 +0800</pubDate><description><![CDATA[题目：http://pat.zju.edu.cn/contests/pat-a-practise/1075
题解：
提交时未通过的在排名输出时显示为0。
需要在排名中显示的至少有一个通过的提交(即只有-1的不显示)。
代码：
#include
#include
#include
#include
#include
#include
#include
#include
#include
u]]></description><category></category></item><item><title><![CDATA[PAT 1043. Is It a Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/ACM_Ted/article/details/20715415</link><guid>https://blog.youkuaiyun.com/ACM_Ted/article/details/20715415</guid><author>ACM_Ted</author><pubDate>Fri, 07 Mar 2014 16:01:30 +0800</pubDate><description><![CDATA[题目：http://pat.zju.edu.cn/contests/pat-a-practise/1043
题解：
1：通过输入构造二叉排序树
2：先序遍历并与输入顺序比较
3：如果比较不符合再构造镜像二叉排序树
4：比较输出结果
代码：
#include
#include
#include
#include
#include
#include
#include
#include
#]]></description><category></category></item></channel></rss>