<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[痴心不改的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/zl_8577</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; zl_8577]]></copyright><item><title><![CDATA[单链表的应用]]></title><link>https://blog.youkuaiyun.com/zl_8577/article/details/82896528</link><guid>https://blog.youkuaiyun.com/zl_8577/article/details/82896528</guid><author>zl_8577</author><pubDate>Sat, 29 Sep 2018 13:58:01 +0800</pubDate><description><![CDATA[//1、使用结构体创建一个结点，结点内容包括一个指向下一个结点的指针和一个char类型的数据
//2、使用一个字符数组创建单链表
//3、从头遍历单链表，设置一个计数器count，count代表当前元素的下标
//    1)、当前元素不是要查找的字符时，指针指向下一个结点，并且计数器count加一
//    2)、如果当前元素是要查找的字符，则返回计数器count
//    3)、如果单链表...]]></description><category></category></item><item><title><![CDATA[顺序表的应用]]></title><link>https://blog.youkuaiyun.com/zl_8577/article/details/82896505</link><guid>https://blog.youkuaiyun.com/zl_8577/article/details/82896505</guid><author>zl_8577</author><pubDate>Sat, 29 Sep 2018 13:56:12 +0800</pubDate><description><![CDATA[typedef struct Student{
	int num;        //学号
	char name[10];  //姓名
	char classnum[5]; //班级
}Student;



int main()
{
	Student array[10] = { { 1, &quot;zhanngsan&quot;, &quot;301&quot; }, { 2, &quot;zhanngsan&quot;, &quot;302&quot; },
	    ...]]></description><category></category></item><item><title><![CDATA[约瑟夫环的应用]]></title><link>https://blog.youkuaiyun.com/zl_8577/article/details/82896474</link><guid>https://blog.youkuaiyun.com/zl_8577/article/details/82896474</guid><author>zl_8577</author><pubDate>Sat, 29 Sep 2018 13:53:19 +0800</pubDate><description><![CDATA[//1、使用结构体创建一个结点，结点内容包括一个指向下一个结点的指针和一个int类型的数据
//2、使用一个字符数组创建单链表
//3、将单链表构造成循环单链表，使用一个指针从头遍历单链表，直到这个指针指向最后一个结点，将这个结点的指针域指向头结点
//4、实现约瑟夫环
//   1)、从当前结点的下一个结点报数，直到找到报数是m的结点，将当前结点的值交给m,使用替换法输出并删除当前结点
//  ...]]></description><category></category></item><item><title><![CDATA[智能指针的实现]]></title><link>https://blog.youkuaiyun.com/zl_8577/article/details/82854028</link><guid>https://blog.youkuaiyun.com/zl_8577/article/details/82854028</guid><author>zl_8577</author><pubDate>Wed, 26 Sep 2018 15:26:42 +0800</pubDate><description><![CDATA[#pragma once
#include&amp;lt;iostream&amp;gt;
using namespace std;

//原理：资源的转移   解决的问题：释放指针
//缺陷：如果一个指针通过拷贝构造和赋值运算符重载将管理的空间交给其他指针，则原指针是没有办法访问这块空间了

#if 0
template&amp;lt;class T&amp;gt;
class AutoPtr
{
public:
	AutoP...]]></description><category></category></item><item><title><![CDATA[删除链表中重复的结点]]></title><link>https://blog.youkuaiyun.com/zl_8577/article/details/82656145</link><guid>https://blog.youkuaiyun.com/zl_8577/article/details/82656145</guid><author>zl_8577</author><pubDate>Wed, 12 Sep 2018 09:25:51 +0800</pubDate><description><![CDATA[class Solution {
public:
    ListNode* deleteDuplication(ListNode* pHead)
    {
          ListNode* first = new ListNode(-1);
          first-&amp;gt;next = pHead;

          ListNode* slow = first;
     ...]]></description><category></category></item><item><title><![CDATA[C++实现排序算法]]></title><link>https://blog.youkuaiyun.com/zl_8577/article/details/82629142</link><guid>https://blog.youkuaiyun.com/zl_8577/article/details/82629142</guid><author>zl_8577</author><pubDate>Tue, 11 Sep 2018 17:18:55 +0800</pubDate><description><![CDATA[#pragma once
#include&amp;lt;iostream&amp;gt;
using namespace std;

//插入排序：时间复杂度：O（lg(N^2)）   空间复杂度：O（1）
//思路：将第i个元素插入到i-1个已排好序的数组中
void InsertSort(int array[], int size)
{
    int i = 0;
    int key = 0;//表示...]]></description><category></category></item><item><title><![CDATA[C++实现迭代器版本的红黑树]]></title><link>https://blog.youkuaiyun.com/zl_8577/article/details/82227930</link><guid>https://blog.youkuaiyun.com/zl_8577/article/details/82227930</guid><author>zl_8577</author><pubDate>Thu, 30 Aug 2018 21:15:15 +0800</pubDate><description><![CDATA[#pragma once
#include&amp;lt;iostream&amp;gt;
using namespace std;

enum COLOR{BLACK,RED};

template&amp;lt;class K,class V&amp;gt;
struct RBTreeNode
{
    RBTreeNode&amp;lt;K, V&amp;gt;* _left;
    RBTreeNode&amp;lt;K, V&amp;gt;* _...]]></description><category></category></item><item><title><![CDATA[C++实现红黑树]]></title><link>https://blog.youkuaiyun.com/zl_8577/article/details/82227904</link><guid>https://blog.youkuaiyun.com/zl_8577/article/details/82227904</guid><author>zl_8577</author><pubDate>Thu, 30 Aug 2018 21:13:07 +0800</pubDate><description><![CDATA[#pragma once
#include&amp;lt;iostream&amp;gt;
using namespace std;

enum COLOR{BLACK,RED};

template&amp;lt;class K,class V&amp;gt;
struct RBTreeNode
{
    RBTreeNode&amp;lt;K, V&amp;gt;* _left;
    RBTreeNode&amp;lt;K, V&amp;gt;* _...]]></description><category></category></item><item><title><![CDATA[C++实现AVL树的基本操作]]></title><link>https://blog.youkuaiyun.com/zl_8577/article/details/82156674</link><guid>https://blog.youkuaiyun.com/zl_8577/article/details/82156674</guid><author>zl_8577</author><pubDate>Wed, 29 Aug 2018 00:06:37 +0800</pubDate><description><![CDATA[AVLTree.hpp

#pragma once
#include&amp;lt;iostream&amp;gt;
using namespace std;
#include&amp;lt;stdlib.h&amp;gt;

template&amp;lt;class K,class V&amp;gt;
struct AVLTreeNode
{
    AVLTreeNode&amp;lt;K, V&amp;gt;* _left;
    AVLTreeNo...]]></description><category></category></item><item><title><![CDATA[C++实现堆的基本操作]]></title><link>https://blog.youkuaiyun.com/zl_8577/article/details/82143853</link><guid>https://blog.youkuaiyun.com/zl_8577/article/details/82143853</guid><author>zl_8577</author><pubDate>Tue, 28 Aug 2018 10:35:48 +0800</pubDate><description><![CDATA[#pragma once
#include&amp;lt;iostream&amp;gt;
using namespace std;
#include&amp;lt;vector&amp;gt;


//小堆
template&amp;lt;class T&amp;gt;
class Heap
{
public:
    Heap()
    {}

    Heap(const T* array, int size)
    {
      ...]]></description><category></category></item><item><title><![CDATA[C++实现二叉树的基本操作]]></title><link>https://blog.youkuaiyun.com/zl_8577/article/details/82080925</link><guid>https://blog.youkuaiyun.com/zl_8577/article/details/82080925</guid><author>zl_8577</author><pubDate>Sun, 26 Aug 2018 15:14:41 +0800</pubDate><description><![CDATA[BinTree.h文件

#pragma once
#pragma once
#include&amp;lt;iostream&amp;gt;
using namespace std;
#include&amp;lt;string.h&amp;gt;
#include&amp;lt;queue&amp;gt;
#include&amp;lt;stack&amp;gt;

template&amp;lt;class T&amp;gt;
struct BinTreeNode
{
...]]></description><category></category></item><item><title><![CDATA[剑指offer面试题  青蛙跳台阶]]></title><link>https://blog.youkuaiyun.com/zl_8577/article/details/81988856</link><guid>https://blog.youkuaiyun.com/zl_8577/article/details/81988856</guid><author>zl_8577</author><pubDate>Thu, 23 Aug 2018 22:00:09 +0800</pubDate><description><![CDATA[题目描述： 
一只青蛙一次可以跳上1级台阶，也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法（先后次序不同算不同的结果）。

class Solution {
public:
    int jumpFloor(int number){
        unsigned  int i = 0;
        long long a = 1;
        long long b = ...]]></description><category></category></item><item><title><![CDATA[剑指offer面试题  斐波那契额数]]></title><link>https://blog.youkuaiyun.com/zl_8577/article/details/81988289</link><guid>https://blog.youkuaiyun.com/zl_8577/article/details/81988289</guid><author>zl_8577</author><pubDate>Thu, 23 Aug 2018 21:21:30 +0800</pubDate><description><![CDATA[class Solution {
public:
    vector&amp;amp;lt;int&amp;amp;gt; printListFromTailToHead(ListNode* head) {
        stack&amp;amp;lt;int&amp;amp;gt; arr;
        vector&amp;amp;lt;int&amp;amp;gt; result;

        while(head!=nullptr)
        {
       ...]]></description><category></category></item><item><title><![CDATA[剑指offer面试题  从尾到头打印链表]]></title><link>https://blog.youkuaiyun.com/zl_8577/article/details/81988254</link><guid>https://blog.youkuaiyun.com/zl_8577/article/details/81988254</guid><author>zl_8577</author><pubDate>Thu, 23 Aug 2018 21:19:42 +0800</pubDate><description><![CDATA[class Solution {
public:
    vector&amp;lt;int&amp;gt; printListFromTailToHead(ListNode* head) {
        stack&amp;lt;int&amp;gt; arr;
        vector&amp;lt;int&amp;gt; result;

        while(head!=nullptr)
        {
       ...]]></description><category></category></item><item><title><![CDATA[剑指offer面试题  空格替换]]></title><link>https://blog.youkuaiyun.com/zl_8577/article/details/81988238</link><guid>https://blog.youkuaiyun.com/zl_8577/article/details/81988238</guid><author>zl_8577</author><pubDate>Thu, 23 Aug 2018 21:18:37 +0800</pubDate><description><![CDATA[class Solution {
public:
    void replaceSpace(char *str,int length) {
       if(str==nullptr&amp;amp;&amp;amp;length&amp;lt;=0)
           return;

        char* cur = str;
        int oldlen = 0;
        int nu...]]></description><category></category></item><item><title><![CDATA[剑指offer面试题--二维数组的查找]]></title><link>https://blog.youkuaiyun.com/zl_8577/article/details/81988220</link><guid>https://blog.youkuaiyun.com/zl_8577/article/details/81988220</guid><author>zl_8577</author><pubDate>Thu, 23 Aug 2018 21:17:44 +0800</pubDate><description><![CDATA[代码实现：

class Solution {
public:
    bool Find(int target, vector&amp;lt;vector&amp;lt;int&amp;gt; &amp;gt; array) {
        int row = array.size();
        int col = array.at(0).size();
        if(row&amp;gt;0&amp;amp;&amp;amp;c...]]></description><category></category></item><item><title><![CDATA[模板实现通用的冒泡排序]]></title><link>https://blog.youkuaiyun.com/zl_8577/article/details/81584554</link><guid>https://blog.youkuaiyun.com/zl_8577/article/details/81584554</guid><author>zl_8577</author><pubDate>Sat, 11 Aug 2018 11:09:20 +0800</pubDate><description><![CDATA[template&amp;lt;class T&amp;gt;
class Less
{
public:
    bool operator()(const T&amp;amp; left, const T&amp;amp; right)
    {
        return left &amp;lt; right;
    }
};

template&amp;lt;class T&amp;gt;
class Greater
{
public:
...]]></description><category></category></item><item><title><![CDATA[C++模板实现队列的基本操作]]></title><link>https://blog.youkuaiyun.com/zl_8577/article/details/81557933</link><guid>https://blog.youkuaiyun.com/zl_8577/article/details/81557933</guid><author>zl_8577</author><pubDate>Fri, 10 Aug 2018 09:51:33 +0800</pubDate><description><![CDATA[方法一：模板实现队列



#pragma once
#include&amp;lt;iostream&amp;gt;
using namespace std;
#include&quot;List.h&quot;

template&amp;lt;class T,class Container = List&amp;lt;T&amp;gt; &amp;gt;
class Queue
{
public:
    Queue()
    {}

    void P...]]></description><category></category></item><item><title><![CDATA[C++模板实现栈的基本操作]]></title><link>https://blog.youkuaiyun.com/zl_8577/article/details/81557814</link><guid>https://blog.youkuaiyun.com/zl_8577/article/details/81557814</guid><author>zl_8577</author><pubDate>Fri, 10 Aug 2018 09:46:31 +0800</pubDate><description><![CDATA[第一种是模板实现：

#pragma once
#include&amp;lt;iostream&amp;gt;
using namespace std;
#include&quot;Vector.h&quot;

template&amp;lt;class T, class Container = Vector&amp;lt;T&amp;gt;&amp;gt;
class Stack
{
public:
    Stack()
    {}

    void ...]]></description><category></category></item><item><title><![CDATA[模板实现带头结点的双向循环链表]]></title><link>https://blog.youkuaiyun.com/zl_8577/article/details/81545204</link><guid>https://blog.youkuaiyun.com/zl_8577/article/details/81545204</guid><author>zl_8577</author><pubDate>Thu, 09 Aug 2018 22:16:06 +0800</pubDate><description><![CDATA[#pragma once
#include&amp;lt;iostream&amp;gt;
using namespace std;


template&amp;lt;class T&amp;gt;
struct ListNode{                 //双向链表
    ListNode(const T&amp;amp; data = T())
    :_next(NULL)
    , _prev(NULL)
  ...]]></description><category></category></item></channel></rss>