<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Japan__的专栏]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/Japan__</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; Japan__]]></copyright><item><title><![CDATA[python 登录并爬取淘宝信息]]></title><link>https://blog.csdn.net/Japan__/article/details/50821586</link><guid>https://blog.csdn.net/Japan__/article/details/50821586</guid><author>Japan__</author><pubDate>Mon, 07 Mar 2016 19:01:34 +0800</pubDate><description><![CDATA[python爬虫的小栗子]]></description><category></category></item><item><title><![CDATA[leetcode Merge Sorted Array]]></title><link>https://blog.csdn.net/Japan__/article/details/47304223</link><guid>https://blog.csdn.net/Japan__/article/details/47304223</guid><author>Japan__</author><pubDate>Wed, 05 Aug 2015 21:38:18 +0800</pubDate><description><![CDATA[void merge(int* nums1, int m, int* nums2, int n) {
//big after


//total length ,the length of nums1 after
   int index=m+n-1;


//get the last element of nums1 before
   int nums1index=m-1;]]></description><category></category></item></channel></rss>