<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[wind_waves的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/wind_waves</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wind_waves]]></copyright><item><title><![CDATA[新的语言新的方向，未来到底指向何方？]]></title><link>https://blog.youkuaiyun.com/wind_waves/article/details/109359679</link><guid>https://blog.youkuaiyun.com/wind_waves/article/details/109359679</guid><author>wind_waves</author><pubDate>Thu, 29 Oct 2020 14:45:55 +0800</pubDate><description><![CDATA[C语言的创始时间是1972年因其优秀的特质(快),在2020年的今天仍然在语言的前几名，新出的语言花样繁多，到底什么样的方向才是我们追求的目的，更快更正确更稳定，现在衡量算法的好坏，我觉得还得再加上新的要求，更好的支持多核处理。

...]]></description><category></category></item><item><title><![CDATA[文件复制（Go语言实现）]]></title><link>https://blog.youkuaiyun.com/wind_waves/article/details/108933487</link><guid>https://blog.youkuaiyun.com/wind_waves/article/details/108933487</guid><author>wind_waves</author><pubDate>Mon, 05 Oct 2020 21:53:56 +0800</pubDate><description><![CDATA[在这里插package main

import (
	"fmt"
	"io"
	"os"
	"strconv"
	"time"
)

type MyCopy struct{}

func NewMyCopy() *MyCopy {
	return new(MyCopy)
}

//保存上次文件读取到的位置
var last string = "./last"

/**
* 功能:文件复制(支持断点续传)
* Seek(offset int64, whence int) (ret int64, err er]]></description><category></category></item><item><title><![CDATA[Go语言认知]]></title><link>https://blog.youkuaiyun.com/wind_waves/article/details/108682357</link><guid>https://blog.youkuaiyun.com/wind_waves/article/details/108682357</guid><author>wind_waves</author><pubDate>Sat, 19 Sep 2020 16:05:18 +0800</pubDate><description><![CDATA[Go语言——面向一线开发的语言
go语言，最近有时间进行较为深度的学习，在了解go语言的过程中，（我是在官网看文档的），go语言有很多小细节，针对一线开发中的麻烦点，进行简化，为一线开发人员大开方便之门。

...]]></description><category></category></item><item><title><![CDATA[2020-9-16实习工作小结]]></title><link>https://blog.youkuaiyun.com/wind_waves/article/details/108625995</link><guid>https://blog.youkuaiyun.com/wind_waves/article/details/108625995</guid><author>wind_waves</author><pubDate>Wed, 16 Sep 2020 17:04:00 +0800</pubDate><description><![CDATA[从公司到学校考试2周后，又来到深圳打工，在深圳一家做人工智能的公司做后台开发实习生，这段时间，我的产品经理没有需求，在对代码了解过后，对测试环境进行了解，每天都在等待新的bug，并协助调查引起错误的原因，在学校都是通过调试来进行排查，在公司这种项目上出现的问题，都是通过日志进行查验。

...]]></description><category></category></item><item><title><![CDATA[工作日记（第一周）]]></title><link>https://blog.youkuaiyun.com/wind_waves/article/details/108106352</link><guid>https://blog.youkuaiyun.com/wind_waves/article/details/108106352</guid><author>wind_waves</author><pubDate>Wed, 19 Aug 2020 17:43:26 +0800</pubDate><description><![CDATA[在昨天结束一周的工作后，做了串讲，忙活了一周去做准备，走错了路，又和提出问题的人进行商量，进行目标转移，进行更进一步的操作。学习如何学习，嗯解释一下，学习如何更有效地学习，从目的出发，拿到需要的资料，进行针对性阅读。事情就很快的完成了，找到合适的路，很快就会抵达终点.

...]]></description><category></category></item><item><title><![CDATA[归并排序]]></title><link>https://blog.youkuaiyun.com/wind_waves/article/details/107804139</link><guid>https://blog.youkuaiyun.com/wind_waves/article/details/107804139</guid><author>wind_waves</author><pubDate>Tue, 04 Aug 2020 23:38:09 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;vector&gt;

using namespace std;


void Show(vector&lt;int&gt; &amp; vec)
{
    vector&lt;int&gt; :: iterator   it = vec.begin();
    for(it;it != vec.end();it++)
    {
        cout&lt;&lt;*it&lt;&lt;"  ";
    }
    c]]></description><category></category></item><item><title><![CDATA[堆排序]]></title><link>https://blog.youkuaiyun.com/wind_waves/article/details/107804123</link><guid>https://blog.youkuaiyun.com/wind_waves/article/details/107804123</guid><author>wind_waves</author><pubDate>Tue, 04 Aug 2020 23:37:25 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;vector&gt;

using namespace std;

void Swap(int &amp;a,int &amp;b)
{
    int tmp = a;
    a = b;
    b = tmp;
}

void Show(vector&lt;int&gt; &amp; vec)
{
    vector&lt;int&gt; :: iterator   it = vec.begin();
    for(i]]></description><category></category></item><item><title><![CDATA[基数排序]]></title><link>https://blog.youkuaiyun.com/wind_waves/article/details/107804117</link><guid>https://blog.youkuaiyun.com/wind_waves/article/details/107804117</guid><author>wind_waves</author><pubDate>Tue, 04 Aug 2020 23:36:39 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;vector&gt;
#include &lt;queue&gt;

using namespace std;

void Show(vector&lt;int&gt; &amp; vec)
{
    vector&lt;int&gt; :: iterator   it = vec.begin();
    for(it;it != vec.end();it++)
    {
        cout&lt;&lt;*it&lt]]></description><category></category></item><item><title><![CDATA[快排]]></title><link>https://blog.youkuaiyun.com/wind_waves/article/details/107623985</link><guid>https://blog.youkuaiyun.com/wind_waves/article/details/107623985</guid><author>wind_waves</author><pubDate>Mon, 27 Jul 2020 23:11:02 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;vector&gt;

using namespace std;


void Swap(int &amp;a,int &amp;b)
{
    int tmp = a;
    a = b;
    b = tmp;
}

void Show(vector&lt;int&gt; &amp; vec)
{
    vector&lt;int&gt; :: iterator   it = vec.begin();
    for(]]></description><category></category></item><item><title><![CDATA[希尔排序]]></title><link>https://blog.youkuaiyun.com/wind_waves/article/details/107623956</link><guid>https://blog.youkuaiyun.com/wind_waves/article/details/107623956</guid><author>wind_waves</author><pubDate>Mon, 27 Jul 2020 23:09:15 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;vector&gt;

using namespace std;


void Swap(int &amp;a,int &amp;b)
{
    int tmp = a;
    a = b;
    b = tmp;
}

void Show(vector&lt;int&gt; &amp; vec)
{
    vector&lt;int&gt; :: iterator   it = vec.begin();
    for(]]></description><category></category></item><item><title><![CDATA[直接插入排序]]></title><link>https://blog.youkuaiyun.com/wind_waves/article/details/107623894</link><guid>https://blog.youkuaiyun.com/wind_waves/article/details/107623894</guid><author>wind_waves</author><pubDate>Mon, 27 Jul 2020 23:06:39 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;vector&gt;

using namespace std;


void Swap(int &amp;a,int &amp;b)
{
    int tmp = a;
    a = b;
    b = tmp;
}

void Show(vector&lt;int&gt; &amp; vec)
{
    vector&lt;int&gt; :: iterator   it = vec.begin();
    for(]]></description><category></category></item><item><title><![CDATA[选择排序]]></title><link>https://blog.youkuaiyun.com/wind_waves/article/details/107623832</link><guid>https://blog.youkuaiyun.com/wind_waves/article/details/107623832</guid><author>wind_waves</author><pubDate>Mon, 27 Jul 2020 23:04:12 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;vector&gt;

using namespace std;


void Swap(int &amp;a,int &amp;b)
{
    int tmp = a;
    a = b;
    b = tmp;
}

void Show(vector&lt;int&gt; &amp; vec)
{
    vector&lt;int&gt; :: iterator   it = vec.begin();
    for(]]></description><category></category></item><item><title><![CDATA[冒泡排序]]></title><link>https://blog.youkuaiyun.com/wind_waves/article/details/107623793</link><guid>https://blog.youkuaiyun.com/wind_waves/article/details/107623793</guid><author>wind_waves</author><pubDate>Mon, 27 Jul 2020 23:02:09 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;vector&gt;

using namespace std;


void Swap(int &amp;a,int &amp;b)
{
    int tmp = a;
    a = b;
    b = tmp;
}

void Show(vector&lt;int&gt; &amp; vec)
{
    vector&lt;int&gt; :: iterator   it = vec.begin();
    for(]]></description><category></category></item><item><title><![CDATA[打家劫舍（三光）]]></title><link>https://blog.youkuaiyun.com/wind_waves/article/details/107549332</link><guid>https://blog.youkuaiyun.com/wind_waves/article/details/107549332</guid><author>wind_waves</author><pubDate>Thu, 23 Jul 2020 22:13:44 +0800</pubDate><description><![CDATA[没啥好说的，嗯，就是那个啥动态规划，对就是动态规划。
class Solution {
public:
    int rob(vector&lt;int&gt;&amp; nums) {
        int n = nums.size();
        vector&lt;int&gt; dp(n);
        dp[0] = nums[0];
        dp[1] = max(nums[0],nums[1]);

        for(int i = 2;i &lt; n;++i)]]></description><category></category></item><item><title><![CDATA[二叉树的中序遍历（递归和非递归）]]></title><link>https://blog.youkuaiyun.com/wind_waves/article/details/107547965</link><guid>https://blog.youkuaiyun.com/wind_waves/article/details/107547965</guid><author>wind_waves</author><pubDate>Thu, 23 Jul 2020 21:14:25 +0800</pubDate><description><![CDATA[非递归：
在这class Solution {
public:
    vector&lt;int&gt; inorderTraversal(TreeNode* root)
    {
        vector&lt;int&gt; vec;
        stack &lt;TreeNode*&gt; sta;
        TreeNode* ptr = root;
        
        while(NULL != ptr || !sta.empty())
        {
   ]]></description><category></category></item><item><title><![CDATA[不同的二叉搜索树]]></title><link>https://blog.youkuaiyun.com/wind_waves/article/details/107525730</link><guid>https://blog.youkuaiyun.com/wind_waves/article/details/107525730</guid><author>wind_waves</author><pubDate>Wed, 22 Jul 2020 23:11:44 +0800</pubDate><description><![CDATA[好吧我是懒狗，看到这个题，第一反应就是，递归去做，这个题也没给时间限制，我就试了一下递归。

int  numTrees(int n)
{
    int sum = 0;
    if(n == 1 || n == 0)
    {
        return 1;
    }
    for(int i = 1;i &lt;= n;++i)
    {
        sum +=numTrees(i-1) * numTrees(n - i);
    }
    return sum;
}

大概就]]></description><category></category></item><item><title><![CDATA[力扣——两数之和（简单）]]></title><link>https://blog.youkuaiyun.com/wind_waves/article/details/107500482</link><guid>https://blog.youkuaiyun.com/wind_waves/article/details/107500482</guid><author>wind_waves</author><pubDate>Tue, 21 Jul 2020 22:26:41 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;

using namespace std;

void   Sum(int *nums,int target,int len,int &amp;f1,int &amp;f2)
{
    if(NULL == nums)return ;
    for(int i = 0;i &lt; len;++i)
    {
        for(int j = i+1;j &lt; len;++j)
        {
            if(nums[i.]]></description><category></category></item><item><title><![CDATA[工厂模式]]></title><link>https://blog.youkuaiyun.com/wind_waves/article/details/107475414</link><guid>https://blog.youkuaiyun.com/wind_waves/article/details/107475414</guid><author>wind_waves</author><pubDate>Mon, 20 Jul 2020 22:09:18 +0800</pubDate><description><![CDATA[简单工厂模式：
#include&lt;iostream&gt;

using namespace std;


class Fruits
{
public:
    Fruits(const string &amp;name)
        :nname(name){}
    virtual  void  Show() = 0;
private:
    string nname;
};


class Apple: public Fruits
{
public:
    Apple(const st]]></description><category></category></item><item><title><![CDATA[不能被继承的类]]></title><link>https://blog.youkuaiyun.com/wind_waves/article/details/107475341</link><guid>https://blog.youkuaiyun.com/wind_waves/article/details/107475341</guid><author>wind_waves</author><pubDate>Mon, 20 Jul 2020 22:05:20 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;


/*
通过友缘和虚继承实现。
在继承层次中，先构造虚基类，可是虚基类A，只能由B来进行构造，也就是说B这个类不能被继承
注意B的声明必须放到A的前面。
*/
using namespace std;

class B;

class A
{
private:
    A()
    {};
    friend class B;
};

class B : virtual public  A
{
public:
    B():A()
    {}
};]]></description><category></category></item><item><title><![CDATA[单例模式]]></title><link>https://blog.youkuaiyun.com/wind_waves/article/details/107395242</link><guid>https://blog.youkuaiyun.com/wind_waves/article/details/107395242</guid><author>wind_waves</author><pubDate>Thu, 16 Jul 2020 22:05:29 +0800</pubDate><description><![CDATA[饿汉模式
/*
#include&lt;iostream&gt;

using namespace std;


class Test 
{
public:
    static Test*  Getinstance()//只能以指针返回，其他不行。static调用约定不是thiscall
    {
        return  m_instance;
    }
private:
    Test()//将构造和拷贝构造写在私有下
    {};
    Test(const Test &amp; r]]></description><category></category></item></channel></rss>