<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ 我的征途从不是星辰大海]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/github_30242787</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; github_30242787]]></copyright><item><title><![CDATA[九章算法8:Data Structure]]></title><link>https://blog.youkuaiyun.com/github_30242787/article/details/50958337</link><guid>https://blog.youkuaiyun.com/github_30242787/article/details/50958337</guid><author>github_30242787</author><pubDate>Tue, 22 Mar 2016 20:52:13 +0800</pubDate><description><![CDATA[Data Structure内容基于九章算法课件  
（http://www.jiuzhang.com/）Linear and treeLinear Data Structure,通常用数组实现 -Queue
 -Stack
 -Hash
Tree Data Structure,通常用指针 -Tree
Queue : BFSO(1) Push Pop TopStack :O(1) Push Pop]]></description><category></category></item><item><title><![CDATA[九章算法7:Array & Numbers]]></title><link>https://blog.youkuaiyun.com/github_30242787/article/details/50891314</link><guid>https://blog.youkuaiyun.com/github_30242787/article/details/50891314</guid><author>github_30242787</author><pubDate>Tue, 15 Mar 2016 00:29:25 +0800</pubDate><description><![CDATA[九章算法7:Array & Numbers内容基于九章算法课件  
（http://www.jiuzhang.com/）Merge two sorted arrayGiven two sorted integer arrays A and B, merge B into A as one sorted array. 
A = [1, 2, 3, empty, empty], B = [4, 5]]]></description><category></category></item><item><title><![CDATA[九章算法6:Linked List]]></title><link>https://blog.youkuaiyun.com/github_30242787/article/details/50881444</link><guid>https://blog.youkuaiyun.com/github_30242787/article/details/50881444</guid><author>github_30242787</author><pubDate>Mon, 14 Mar 2016 00:08:04 +0800</pubDate><description><![CDATA[九章算法6:Linked List内容基于九章算法课件  
（http://www.jiuzhang.com/）链表的结构 
如果我进行两个操作:  1.node1 = node2;
  2.print head
具体代码 
  
 结果仍是            1 2 3
因为node1只是一个地址信息,如果把内存比作一个大数组, 这个node1 
只是这个数组的index. node1 = n]]></description><category></category></item><item><title><![CDATA[九章算法5:动态规划II]]></title><link>https://blog.youkuaiyun.com/github_30242787/article/details/50823201</link><guid>https://blog.youkuaiyun.com/github_30242787/article/details/50823201</guid><author>github_30242787</author><pubDate>Mon, 07 Mar 2016 23:02:42 +0800</pubDate><description><![CDATA[九章算法5:动态规划II内容基于九章算法课件  
（http://www.jiuzhang.com/）单序列动态规划 
题目:Palindrome Partitioning 
Given a string s, cut s into some substrings such that every substring is a palindrome.Return the minimum cuts ne]]></description><category></category></item><item><title><![CDATA[九章算法4:动态规划I]]></title><link>https://blog.youkuaiyun.com/github_30242787/article/details/50819414</link><guid>https://blog.youkuaiyun.com/github_30242787/article/details/50819414</guid><author>github_30242787</author><pubDate>Mon, 07 Mar 2016 15:03:02 +0800</pubDate><description><![CDATA[递归和动态规划内容基于九章算法课件（http://www.jiuzhang.com/） 
从Triangle这个问题说起：题目：Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. 
Example： 
G]]></description><category></category></item></channel></rss>