<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[happyp9的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/happyp9</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; happyp9]]></copyright><item><title><![CDATA[输入一个链表，从尾到头打印链表每个节点的值。]]></title><link>https://blog.youkuaiyun.com/happyp9/article/details/52102253</link><guid>https://blog.youkuaiyun.com/happyp9/article/details/52102253</guid><author>happyp9</author><pubDate>Wed, 03 Aug 2016 11:54:52 +0800</pubDate><description><![CDATA[题目描述
输入一个链表，从尾到头打印链表每个节点的值。
输入描述:
输入为链表的表头


输出描述:
输出为需要打印的“新链表”的表头










/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) ]]></description><category></category></item><item><title><![CDATA[请实现一个函数，将一个字符串中的空格替换成“%20”。]]></title><link>https://blog.youkuaiyun.com/happyp9/article/details/52102244</link><guid>https://blog.youkuaiyun.com/happyp9/article/details/52102244</guid><author>happyp9</author><pubDate>Wed, 03 Aug 2016 11:54:07 +0800</pubDate><description><![CDATA[题目描述
请实现一个函数，将一个字符串中的空格替换成“%20”。例如，当字符串为We Are Happy.则经过替换之后的字符串为We%20Are%20Happy。 









//length为牛客系统规定字符串输出的最大长度，固定为一个常数
class Solution {
public:
void replaceSpace(char *str,int le]]></description><category></category></item><item><title><![CDATA[小米Git问题-学习笔记]]></title><link>https://blog.youkuaiyun.com/happyp9/article/details/52102205</link><guid>https://blog.youkuaiyun.com/happyp9/article/details/52102205</guid><author>happyp9</author><pubDate>Wed, 03 Aug 2016 11:50:32 +0800</pubDate><description><![CDATA[git是一种分布式代码管理工具，git通过树的形式记录文件的更改历史，比如：base'

输入例子:
[01011,10100,01000,10000,10000],1,2

输出例子:
1






class Solution {
public:
    /**
     * 返回git树上两点的最近分割点
     * 
     * @param ma]]></description><category></category></item><item><title><![CDATA[字符串的next特征函数，KMP算法，C++]]></title><link>https://blog.youkuaiyun.com/happyp9/article/details/51178994</link><guid>https://blog.youkuaiyun.com/happyp9/article/details/51178994</guid><author>happyp9</author><pubDate>Mon, 18 Apr 2016 13:41:33 +0800</pubDate><description><![CDATA[//用KMP算法中计算字符串的next的特征函数实现过程，用c++实现

---------------------------------------------------------------------------------------------------------------------------------------------------------

#inc]]></description><category></category></item><item><title><![CDATA[用递归解决八皇后问题，C++语言实现]]></title><link>https://blog.youkuaiyun.com/happyp9/article/details/51172290</link><guid>https://blog.youkuaiyun.com/happyp9/article/details/51172290</guid><author>happyp9</author><pubDate>Sun, 17 Apr 2016 11:13:31 +0800</pubDate><description><![CDATA[用递归解决八皇后问题，C++语言实现
    以下为具体实现过程。

 --------------------------分割线-------------------------------------
#includeiostream>
using namespace std;
const int qesz=8;//问题为qesz=8的皇后问题,修改qesz的大小可以解决N皇后问题。

c]]></description><category></category></item></channel></rss>