<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[MaxCliff的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/MaxCliff</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; MaxCliff]]></copyright><item><title><![CDATA[java,Python,JavaScript使用缓存技术计算斐波那契数列]]></title><link>https://blog.youkuaiyun.com/MaxCliff/article/details/79538637</link><guid>https://blog.youkuaiyun.com/MaxCliff/article/details/79538637</guid><author>MaxCliff</author><pubDate>Tue, 13 Mar 2018 12:02:54 +0800</pubDate><description><![CDATA[ //Java版本import java.util.*;public class CalculateFib{    static Map&amp;lt;Integer,Integer&amp;gt; m=new HashMap&amp;lt;Integer,Integer&amp;gt;();    public static int fib(int n){        if (n&amp;lt;3){                ...]]></description><category></category></item><item><title><![CDATA[爱奇艺算法实习生面试题]]></title><link>https://blog.youkuaiyun.com/MaxCliff/article/details/79445517</link><guid>https://blog.youkuaiyun.com/MaxCliff/article/details/79445517</guid><author>MaxCliff</author><pubDate>Mon, 05 Mar 2018 15:05:14 +0800</pubDate><description><![CDATA[给一个多边形，寻找一条线，把这个多边形分成面积相等的两部分？思路1. 把这个多边形拆分成一个个小的三角形。2.从某一个三角形开始，从顶点连接到对边的中的点，再从中点连接到该条边对应的定点3.重复第二步工作。Python实现#coding:utf-8#多变形的顶点(顺时针方向按顺序给出)endPoints=[(0,0),(0,1),(1,1),(1,0)]def partitionPolygon(p...]]></description><category></category></item><item><title><![CDATA[合并链表]]></title><link>https://blog.youkuaiyun.com/MaxCliff/article/details/77096247</link><guid>https://blog.youkuaiyun.com/MaxCliff/article/details/77096247</guid><author>MaxCliff</author><pubDate>Fri, 11 Aug 2017 13:12:45 +0800</pubDate><description><![CDATA[搜狐面试考官出的一个数据结构题，当时没写出来，回来花了一天写出来了。虽然比较基础，但是想临场写出来，还是有一定难度。]]></description><category></category></item><item><title><![CDATA[简单的遗传算法实例]]></title><link>https://blog.youkuaiyun.com/MaxCliff/article/details/75929139</link><guid>https://blog.youkuaiyun.com/MaxCliff/article/details/75929139</guid><author>MaxCliff</author><pubDate>Sun, 23 Jul 2017 17:19:13 +0800</pubDate><description><![CDATA[这个例子，体现了遗传算法的一些概念，后续博客还会深入介绍这一重要算法。]]></description><category></category></item><item><title><![CDATA[贪婪算法（活动安排问题）]]></title><link>https://blog.youkuaiyun.com/MaxCliff/article/details/53572144</link><guid>https://blog.youkuaiyun.com/MaxCliff/article/details/53572144</guid><author>MaxCliff</author><pubDate>Sun, 11 Dec 2016 11:16:25 +0800</pubDate><description><![CDATA[#include

int recursive_activity_select(int * s,int *f,int k,int n);

int main(void)

{       int s[12]={0,1,3,0,5,3,5,6,8,8,2,12};

        int f[12]={0,4,5,6,7,9,9,10,11,12,14,16};

      ]]></description><category></category></item><item><title><![CDATA[LCS]]></title><link>https://blog.youkuaiyun.com/MaxCliff/article/details/53506732</link><guid>https://blog.youkuaiyun.com/MaxCliff/article/details/53506732</guid><author>MaxCliff</author><pubDate>Wed, 07 Dec 2016 15:26:02 +0800</pubDate><description><![CDATA[#include 

void lcs_length(const int m,const int n ,int (*count)[n+1],char (*res)[n],const char * x,const char * y);

int  print_lcs(int a,int b,int n,char (*res)[n],char *y);




int main(vo]]></description><category></category></item><item><title><![CDATA[矩阵连乘最优化问题]]></title><link>https://blog.youkuaiyun.com/MaxCliff/article/details/53462444</link><guid>https://blog.youkuaiyun.com/MaxCliff/article/details/53462444</guid><author>MaxCliff</author><pubDate>Mon, 05 Dec 2016 09:58:30 +0800</pubDate><description><![CDATA[#include 

void print_optimal_parens(int n,int (*s)[n+1],int i,int j);

void matrix_order_optimal(int * p,int n,int (*m)[n+1],int (*s)[n+1]);

int main(void)

{       const int d_size=7;

  ]]></description><category></category></item><item><title><![CDATA[区间树]]></title><link>https://blog.youkuaiyun.com/MaxCliff/article/details/53327535</link><guid>https://blog.youkuaiyun.com/MaxCliff/article/details/53327535</guid><author>MaxCliff</author><pubDate>Thu, 24 Nov 2016 23:24:02 +0800</pubDate><description><![CDATA[/**********************interval_tree.h************************/

                    /*头文件*/

typedef struct{

int low_endpoint;

int high_endpoint;

}inte;

typedef struct node{

inte i]]></description><category></category></item><item><title><![CDATA[顺序查找树]]></title><link>https://blog.youkuaiyun.com/MaxCliff/article/details/53314094</link><guid>https://blog.youkuaiyun.com/MaxCliff/article/details/53314094</guid><author>MaxCliff</author><pubDate>Thu, 24 Nov 2016 00:00:43 +0800</pubDate><description><![CDATA[/**********************OST.h************************/

                    /*头文件*/

typedef struct node{

char color;

int key;

struct node * p;

struct node *left;

struct node * right]]></description><category></category></item><item><title><![CDATA[红黑树（插入与删除）]]></title><link>https://blog.youkuaiyun.com/MaxCliff/article/details/53265739</link><guid>https://blog.youkuaiyun.com/MaxCliff/article/details/53265739</guid><author>MaxCliff</author><pubDate>Mon, 21 Nov 2016 22:09:31 +0800</pubDate><description><![CDATA[大体上与二叉树差不多，使用图形来辅助记忆]]></description><category></category></item><item><title><![CDATA[BST(C语言)]]></title><link>https://blog.youkuaiyun.com/MaxCliff/article/details/53119435</link><guid>https://blog.youkuaiyun.com/MaxCliff/article/details/53119435</guid><author>MaxCliff</author><pubDate>Thu, 10 Nov 2016 19:24:08 +0800</pubDate><description><![CDATA[/****************************************************

            BST.h

 ***************************************************/

// 定义节点

typedef struct node

{ struct node * parent;

stru]]></description><category></category></item><item><title><![CDATA[反转单链表(C)]]></title><link>https://blog.youkuaiyun.com/MaxCliff/article/details/52931380</link><guid>https://blog.youkuaiyun.com/MaxCliff/article/details/52931380</guid><author>MaxCliff</author><pubDate>Wed, 26 Oct 2016 09:45:40 +0800</pubDate><description><![CDATA[#include 

#include 

#include 

typedef struct  list

{       int key;

        struct list  *next;

} node;

void print(node *  );

node* reverse(node* );

int main(void)

{

 ]]></description><category></category></item><item><title><![CDATA[先进后出堆（C）]]></title><link>https://blog.youkuaiyun.com/MaxCliff/article/details/52900827</link><guid>https://blog.youkuaiyun.com/MaxCliff/article/details/52900827</guid><author>MaxCliff</author><pubDate>Sun, 23 Oct 2016 11:51:37 +0800</pubDate><description><![CDATA[FILO堆，使用数组就能实现其压入与弹出操作。]]></description><category></category></item><item><title><![CDATA[FuzzBuzz （C语言）]]></title><link>https://blog.youkuaiyun.com/MaxCliff/article/details/52841891</link><guid>https://blog.youkuaiyun.com/MaxCliff/article/details/52841891</guid><author>MaxCliff</author><pubDate>Mon, 17 Oct 2016 21:48:28 +0800</pubDate><description><![CDATA[写一个程序输出字符串代表数1到n，如果数能被3整除，输出"Fizz",能被5整除"Buzz"，既能被3也能被5整除输出"FizzBuzz"。
比如：
n = 15,

Return:
[
    "1",
    "2",
    "Fizz",
    "4",
    "Buzz",
    "Fizz",
    "7",
    "8",
    "Fizz",
    "Buzz",
    "11",
    "Fizz",
    "13",
    "14",
    "FizzBuzz"
]]></description><category></category></item><item><title><![CDATA[基数排序(RadixSortC语言)]]></title><link>https://blog.youkuaiyun.com/MaxCliff/article/details/52820194</link><guid>https://blog.youkuaiyun.com/MaxCliff/article/details/52820194</guid><author>MaxCliff</author><pubDate>Sat, 15 Oct 2016 00:52:06 +0800</pubDate><description><![CDATA[网上很多基数排序的代码，设计的不够好，需要人为的输入各个位。
在GeeksforGeeks上copy下来，自己作了一点修改。
代码写的清晰明了，结构简单，值得学习。]]></description><category></category></item><item><title><![CDATA[计数排序（性能测试）]]></title><link>https://blog.youkuaiyun.com/MaxCliff/article/details/52806059</link><guid>https://blog.youkuaiyun.com/MaxCliff/article/details/52806059</guid><author>MaxCliff</author><pubDate>Thu, 13 Oct 2016 13:26:40 +0800</pubDate><description><![CDATA[计数排序在数组元素个数n,与数组最大元素k，满足k=O(n)时，该算法是一种高效的非比较排序的线性算法。]]></description><category></category></item><item><title><![CDATA[快速排序（随机化版本）]]></title><link>https://blog.youkuaiyun.com/MaxCliff/article/details/52795876</link><guid>https://blog.youkuaiyun.com/MaxCliff/article/details/52795876</guid><author>MaxCliff</author><pubDate>Wed, 12 Oct 2016 12:23:01 +0800</pubDate><description><![CDATA[随机化版本的快速排序相比于之前的普通排序，唯一的区别就是，随机的选取数组中的任何一个数作为主元素，而不像普通排序那样，数组一旦给定，主元素便确定了；
与前篇文章普通排序相比，对代码进行了改进，增加了随机数生成函数，以及交换数组元素的函数，代码结构相对来说更加清晰了。]]></description><category></category></item><item><title><![CDATA[快速排序（C性能测试）]]></title><link>https://blog.youkuaiyun.com/MaxCliff/article/details/52791418</link><guid>https://blog.youkuaiyun.com/MaxCliff/article/details/52791418</guid><author>MaxCliff</author><pubDate>Tue, 11 Oct 2016 20:35:59 +0800</pubDate><description><![CDATA[快速排序虽然时间复杂度和合并排序与堆排序算法一样；但相比于合并排序，快速排序是原地排序，作者用200w的随机元素构成的数组进行性能测试，发现快速排序只需要0.4s，而合并排序需要0.5s左右，性能上是优于合并排序的；同样的，堆排序需要1s左右。快速排序是一种优秀的排序算法，应用也是非常的广泛。]]></description><category></category></item><item><title><![CDATA[基于最大堆的最大优先队列的实现（C语言）]]></title><link>https://blog.youkuaiyun.com/MaxCliff/article/details/52779888</link><guid>https://blog.youkuaiyun.com/MaxCliff/article/details/52779888</guid><author>MaxCliff</author><pubDate>Mon, 10 Oct 2016 17:36:39 +0800</pubDate><description><![CDATA[有两个地方需要关注：1.通过定义具有外部链接的的变量来记录优先队列的大小 2.两次使用while(getchar()!='\n') continue这个结构来处理缓存中的字符。]]></description><category></category></item><item><title><![CDATA[最大堆排序（性能测试）]]></title><link>https://blog.youkuaiyun.com/MaxCliff/article/details/52771988</link><guid>https://blog.youkuaiyun.com/MaxCliff/article/details/52771988</guid><author>MaxCliff</author><pubDate>Sun, 09 Oct 2016 23:28:28 +0800</pubDate><description><![CDATA[同样是对200w个随机数的数组，使用合并排序只需要0.5s左右，堆排序需要1s左右；虽然两种算法的时间复杂度都是O(nlgn),但堆排序系数更大，操作更复杂，所以时间花费更多]]></description><category></category></item></channel></rss>