<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[buptmichael的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/buptmichael</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; buptmichael]]></copyright><item><title><![CDATA[三元组最小距离[阿里2013校招题目]]]></title><link>https://blog.youkuaiyun.com/buptmichael/article/details/39294219</link><guid>https://blog.youkuaiyun.com/buptmichael/article/details/39294219</guid><author>buptmichael</author><pubDate>Mon, 15 Sep 2014 16:47:21 +0800</pubDate><description><![CDATA[已知三个升序整数数组a[l], b[m]和c[n]。请在三个数组中各找一个元素，使得组成的三元组距离最小。

三元组的距离定义是：假设a[i]、b[j]和c[k]是一个三元组，那么距离为:Distance = max(|a[i]–b[j]|,|a[i]–c[k]|,|b[j]–c[k]|)请设计一个求最小三元组距离的最优算法，并分析时间复杂度。]]></description><category></category></item><item><title><![CDATA[求数组最大最小值[阿里2013校招题目]]]></title><link>https://blog.youkuaiyun.com/buptmichael/article/details/39293661</link><guid>https://blog.youkuaiyun.com/buptmichael/article/details/39293661</guid><author>buptmichael</author><pubDate>Mon, 15 Sep 2014 16:08:40 +0800</pubDate><description><![CDATA[设计一个最优算法来查找一n个元素数组中的最大值和最小值。已知一种需要比较2n次的方法，请给一个更优的算法。情特别注意优化时间复杂度的常数。]]></description><category></category></item></channel></rss>