<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[sunshine552的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sunshine552</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sunshine552]]></copyright><item><title><![CDATA[二叉树的深度]]></title><link>https://blog.youkuaiyun.com/sunshine552/article/details/120679554</link><guid>https://blog.youkuaiyun.com/sunshine552/article/details/120679554</guid><author>sunshine552</author><pubDate>Sat, 09 Oct 2021 22:03:27 +0800</pubDate><description><![CDATA[思路一：递归遍历

代码：

/*
struct TreeNode {
 int val;
 struct TreeNode *left;
 struct TreeNode *right;
 TreeNode(int x) :
   val(x), left(NULL), right(NULL) {
 }
};*/
class Solution {
public:
  int TreeDepth(TreeNode* pRoot) {
    if ...]]></description><category></category></item><item><title><![CDATA[删除链表中的节点]]></title><link>https://blog.youkuaiyun.com/sunshine552/article/details/120660415</link><guid>https://blog.youkuaiyun.com/sunshine552/article/details/120660415</guid><author>sunshine552</author><pubDate>Sat, 09 Oct 2021 21:27:44 +0800</pubDate><description><![CDATA[题目一：删除链表中的节点：

1、时间复杂度为O(n)，找到要删除链表的前一个节点，将该节点的next指向要删除的链表的next，然后删除该节点并置为NULL;

2、时间复杂度为O(1)，将要删除节点的后面的节点的值赋给删除的节点，将删除节点的next指向后面节点的next，然后删除后面的节点并置为NULL;

注意：要考虑只有一个节点的情况，删除头节点也是尾节点；还要考虑如果要删除的节点是尾节点的情况，时间复杂度为O(n)，要顺序遍历到尾节点的前一个节点，然后删除置为NULL；上述两种方法是基于要删除的]]></description><category></category></item><item><title><![CDATA[链表中倒数第k个节点]]></title><link>https://blog.youkuaiyun.com/sunshine552/article/details/120630688</link><guid>https://blog.youkuaiyun.com/sunshine552/article/details/120630688</guid><author>sunshine552</author><pubDate>Wed, 06 Oct 2021 22:29:38 +0800</pubDate><description><![CDATA[思路：设置两个指针，第一个指针先走k步，第二个节点从起始点开始走，第一个节点走到末尾时，第二个节点也就是倒数第k个节点。

代码：

/**
* struct ListNode {
* int val;
* struct ListNode *next;
* ListNode(int x) : val(x), next(nullptr) {}
* };
*/
class Solution {
public:
  /**
  * 代码中的类名、方法名、参数名已经指定，请勿...]]></description><category></category></item><item><title><![CDATA[链表中环的入口节点]]></title><link>https://blog.youkuaiyun.com/sunshine552/article/details/120629920</link><guid>https://blog.youkuaiyun.com/sunshine552/article/details/120629920</guid><author>sunshine552</author><pubDate>Wed, 06 Oct 2021 22:01:46 +0800</pubDate><description><![CDATA[思路：快慢指针-&gt;快指针一次走两步，慢指针一次走一步。

结论：1、设置快慢指针，假如有环，一定会在环中相遇；

      2、两个指针相遇后，两个指针分别在表头和相遇点重新出发，每次只走一步，最后一定相遇于环入口。



验证结论：

    1、快指针一次走两步，慢指针一次走一步，慢指针一旦入环，就当作是快指针追慢指针，最后一定能追上；

    2、假设快指针走的路径为：a+b+c+b，慢指针走的路径为a+b，因为快指针是慢指针走的2倍，所以：a+b+c+b=2(...]]></description><category></category></item><item><title><![CDATA[git新手学习和使用]]></title><link>https://blog.youkuaiyun.com/sunshine552/article/details/51693029</link><guid>https://blog.youkuaiyun.com/sunshine552/article/details/51693029</guid><author>sunshine552</author><pubDate>Thu, 16 Jun 2016 18:47:58 +0800</pubDate><description><![CDATA[一、git简介
1、基本概念：
git是一个开源的分布式版本控制系统。相对CVS和SVN是集中式的版本控制系统。集中式版本控制系统的版本库是集中放在中央
服务器的，每次工作的时候都得从中央服务器获取最新的版本，完了以后再放回中央服务器。而分布式版本控制系统没有中央服器，
每个人电脑上都有一个完整的版本库，可以自己操作不受任何人影响。
2、版本库（Repository）
版本库(Repo]]></description><category></category></item><item><title><![CDATA[【Linux】多路复用之—epoll]]></title><link>https://blog.youkuaiyun.com/sunshine552/article/details/51474167</link><guid>https://blog.youkuaiyun.com/sunshine552/article/details/51474167</guid><author>sunshine552</author><pubDate>Sun, 22 May 2016 12:17:03 +0800</pubDate><description><![CDATA[一、多路复用之——epoll
int 
epoll_create(int size)；
int 
epoll_ctl(int epfd，int op，int fd，struct epoll_event* event)；
int 
epoll_wait(int epfd，struct epoll_event* events，int maxevents，int timeout)；
1、e]]></description><category></category></item><item><title><![CDATA[【Linux】多路复用之—poll]]></title><link>https://blog.youkuaiyun.com/sunshine552/article/details/51471893</link><guid>https://blog.youkuaiyun.com/sunshine552/article/details/51471893</guid><author>sunshine552</author><pubDate>Sat, 21 May 2016 20:12:51 +0800</pubDate><description><![CDATA[一：多路复用之——poll
#include
int poll(struct pollfd *fs，nfds_t nfds，int timeout)


1、参数：
struct pollfd{
int fd                             关心的文件描述符
short events                关心的事件
short revents]]></description><category></category></item><item><title><![CDATA[【Linux】多路复用之—select]]></title><link>https://blog.youkuaiyun.com/sunshine552/article/details/51460502</link><guid>https://blog.youkuaiyun.com/sunshine552/article/details/51460502</guid><author>sunshine552</author><pubDate>Fri, 20 May 2016 21:21:08 +0800</pubDate><description><![CDATA[一：多路复用之——select
int select(int nfds，fd_set  *readfds，fd_set *writefds，fd_set *exceptfds，struct timeval* timeout)
  1、参数：   （1）nfds：需要监视的文件描述符数目；
                     （2）readfds、writefds、ecceptfds：对]]></description><category></category></item><item><title><![CDATA[循环链表]]></title><link>https://blog.youkuaiyun.com/sunshine552/article/details/48575565</link><guid>https://blog.youkuaiyun.com/sunshine552/article/details/48575565</guid><author>sunshine552</author><pubDate>Sat, 19 Sep 2015 15:36:12 +0800</pubDate><description><![CDATA[#include
using namespace std;
typedef int DataType;
class LinkNode
{
	friend class Slist;
public:
	LinkNode(const DataType& x)
		:_date(x)
		, _prev(NULL)
		, _next(NULL)
	{
	}
public:
	DataType _date]]></description><category></category></item><item><title><![CDATA[【C++】深拷贝]]></title><link>https://blog.youkuaiyun.com/sunshine552/article/details/48575147</link><guid>https://blog.youkuaiyun.com/sunshine552/article/details/48575147</guid><author>sunshine552</author><pubDate>Sat, 19 Sep 2015 14:54:38 +0800</pubDate><description><![CDATA[#include
using namespace std;
class String
{
public:
	//无参构造函数
	String()
		:_ptr(new char[1])
	{
		_ptr[0] = '\0';
	}
	//有参构造函数
	String(char* ptr)
		:_ptr(new char[strlen(ptr)+1])
	{
		strcpy(_ptr, pt]]></description><category></category></item><item><title><![CDATA[【C++】写时拷贝COW]]></title><link>https://blog.youkuaiyun.com/sunshine552/article/details/48462333</link><guid>https://blog.youkuaiyun.com/sunshine552/article/details/48462333</guid><author>sunshine552</author><pubDate>Tue, 15 Sep 2015 07:43:46 +0800</pubDate><description><![CDATA[#include
using namespace std;
class String
{
public:
	//构造函数
	String(const char* str="")
		:_str(new char[strlen(str)+1])
		, _CountRef(new int(1))
	{
		strcpy(_str, str);
	}
	//拷贝构造
	String(const Str]]></description><category></category></item><item><title><![CDATA[【C++】实现单链表]]></title><link>https://blog.youkuaiyun.com/sunshine552/article/details/48436179</link><guid>https://blog.youkuaiyun.com/sunshine552/article/details/48436179</guid><author>sunshine552</author><pubDate>Mon, 14 Sep 2015 10:40:09 +0800</pubDate><description><![CDATA[#include
using namespace std;

typedef int DataType;
struct LinkNode
{
	DataType _date;
	LinkNode* _next;
	LinkNode(const DataType& x)
	{
		_date = x;
		_next = NULL;
	}
};
class SList
{
public:
	//构造]]></description><category></category></item><item><title><![CDATA[【C++】实现顺序表]]></title><link>https://blog.youkuaiyun.com/sunshine552/article/details/48436107</link><guid>https://blog.youkuaiyun.com/sunshine552/article/details/48436107</guid><author>sunshine552</author><pubDate>Mon, 14 Sep 2015 10:38:03 +0800</pubDate><description><![CDATA[#pragma once

#include
using namespace std;

#define DefauleCapacity 5
typedef int DataType;

class Seqlist
{
public:
	//构造函数
	Seqlist()
		:_array(new DataType[DefauleCapacity])
	{
		_capacity = Defau]]></description><category></category></item><item><title><![CDATA[【C++】实现万年历]]></title><link>https://blog.youkuaiyun.com/sunshine552/article/details/48133233</link><guid>https://blog.youkuaiyun.com/sunshine552/article/details/48133233</guid><author>sunshine552</author><pubDate>Mon, 31 Aug 2015 14:14:09 +0800</pubDate><description><![CDATA[/******************************************************************************************
Purpose:
声明并实现一个万年历类【腾讯面试题】

Author:
周蒙蒙

Created Time:
2015-8-19
******************************************]]></description><category></category></item><item><title><![CDATA[double my_atof(char *str)]]></title><link>https://blog.youkuaiyun.com/sunshine552/article/details/47292125</link><guid>https://blog.youkuaiyun.com/sunshine552/article/details/47292125</guid><author>sunshine552</author><pubDate>Wed, 05 Aug 2015 09:48:57 +0800</pubDate><description><![CDATA[编写一个函数，将一个数字字符串转换成这个字符串对应的数字（包括正浮点数、负浮点数）
例如：“12.34“   
返回12.34“ - 123.34“ 返回 - 123.34函数原型：double my_atof(char *str)
#include
#include
#include

double my_atof(char *str)
{
	double ret = 0.0;
	int ]]></description><category></category></item><item><title><![CDATA[动态链表增删改查及排序功能]]></title><link>https://blog.youkuaiyun.com/sunshine552/article/details/46651179</link><guid>https://blog.youkuaiyun.com/sunshine552/article/details/46651179</guid><author>sunshine552</author><pubDate>Fri, 26 Jun 2015 16:09:02 +0800</pubDate><description><![CDATA[主要功能的实现：
#include "SeqList.h"
void InitSeqList(SeqList * pSeq)//初始化
{
	assert(pSeq);
	pSeq->array = (DataType*)malloc(sizeof(DataType)*DEFAULT_CAPICITY);
	pSeq->size = 0;
	pSeq->capicity = DEFAULT_CA]]></description><category></category></item><item><title><![CDATA[实现位操作]]></title><link>https://blog.youkuaiyun.com/sunshine552/article/details/46428245</link><guid>https://blog.youkuaiyun.com/sunshine552/article/details/46428245</guid><author>sunshine552</author><pubDate>Tue, 09 Jun 2015 16:27:24 +0800</pubDate><description><![CDATA[//实现对一个8bit数据(unsigned char类型)的指定位的置0或者置1操作，并保持其他位不变
#include
void bit_set(unsigned char *p_data,unsigned char position,int flag)
{
	unsigned char bit=1<<(position-1);
	if(flag)//置1操作
	{
		*p_data=*p]]></description><category></category></item><item><title><![CDATA[【C语言】字符串操作函数my_strcpy]]></title><link>https://blog.youkuaiyun.com/sunshine552/article/details/45915941</link><guid>https://blog.youkuaiyun.com/sunshine552/article/details/45915941</guid><author>sunshine552</author><pubDate>Fri, 22 May 2015 13:09:24 +0800</pubDate><description><![CDATA[//实现字符串操作函数strcpy
#include
#include
char *my_strcpy(char *dest, const char *src)
{
	char *ret = dest;
	assert((dest != NULL) && (src != NULL));//断言
	if(dest == src)
		return dest;
	while(*dest++ = *sr]]></description><category></category></item><item><title><![CDATA[【C语言】字符串操作函数my_strcat]]></title><link>https://blog.youkuaiyun.com/sunshine552/article/details/45915931</link><guid>https://blog.youkuaiyun.com/sunshine552/article/details/45915931</guid><author>sunshine552</author><pubDate>Fri, 22 May 2015 13:07:40 +0800</pubDate><description><![CDATA[//实现字符串操作函数strcat
#include
#include
char *my_strcat(char *str1,char const *str2)
{
	char *p=str1;
	assert((str1 != NULL) && (str2 != NULL));
	while(*str1 !='\0')
	{
		str1++;
	}
	while(*str2 !='\0')
	]]></description><category></category></item><item><title><![CDATA[【C语言】字符串操作函数my_strcmp]]></title><link>https://blog.youkuaiyun.com/sunshine552/article/details/45915919</link><guid>https://blog.youkuaiyun.com/sunshine552/article/details/45915919</guid><author>sunshine552</author><pubDate>Fri, 22 May 2015 13:05:33 +0800</pubDate><description><![CDATA[//实现字符串操作函数strcmp
#include
int my_strcmp(char *str1,char *str2)
{
	while(*str1==*str2)
	{
		if(*str1=='\0')
			return 0;
		else
		{
			str1++;
			str2++;
		}
	}
	if(*str1>*str2)
		return -1;
	else
		r]]></description><category></category></item></channel></rss>