<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[leonharddt的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/leonharddt</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; leonharddt]]></copyright><item><title><![CDATA[Ubuntu16.04 构建opencl+caffe]]></title><link>https://blog.youkuaiyun.com/leonharddt/article/details/78806029</link><guid>https://blog.youkuaiyun.com/leonharddt/article/details/78806029</guid><author>leonharddt</author><pubDate>Thu, 14 Dec 2017 19:03:30 +0800</pubDate><description><![CDATA[1. basic settings

sudo apt update && sudo apt upgrade to update your system.
sudo apt install python-pip
sudo apt install vim
sudo apt install git
sudo apt install cmake
2. Install Intel OpenCL SD]]></description><category></category></item><item><title><![CDATA[编译caffe on Ubuntu16.04]]></title><link>https://blog.youkuaiyun.com/leonharddt/article/details/78781045</link><guid>https://blog.youkuaiyun.com/leonharddt/article/details/78781045</guid><author>leonharddt</author><pubDate>Tue, 12 Dec 2017 13:47:49 +0800</pubDate><description><![CDATA[1. 确保系统内已经存在Cuda8.0
方法：在、usr/local/cuda/下找到sample，进入目录，键入

make all
编译完成后，找到device_query这个执行文件并运行。如果Cuda安装成功，会显示GPU相关信息


2. 安装依赖包

sudo apt-get install libprotobuf-dev libleveldb-dev libsnap]]></description><category></category></item><item><title><![CDATA[[Easy]C++ 第二期 7道]]></title><link>https://blog.youkuaiyun.com/leonharddt/article/details/75084578</link><guid>https://blog.youkuaiyun.com/leonharddt/article/details/75084578</guid><author>leonharddt</author><pubDate>Wed, 22 Nov 2017 21:04:21 +0800</pubDate><description><![CDATA[104. Maximum Depth of Binary Tree

二叉树最大深度


Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthes]]></description><category></category></item><item><title><![CDATA[C++ 自己动手写排序]]></title><link>https://blog.youkuaiyun.com/leonharddt/article/details/78512534</link><guid>https://blog.youkuaiyun.com/leonharddt/article/details/78512534</guid><author>leonharddt</author><pubDate>Sun, 12 Nov 2017 16:22:19 +0800</pubDate><description><![CDATA[全部给我死记硬背住！！！
一、插入排序
void InsertSort(int *arr, int arrLen)
{
    for (int i = 1; i < arrLen; i++)
    {
        int tmp = arr[i];
        int j = 0;
        for (j = i; j > 0 && tmp < arr[j-1]; j--)]]></description><category></category></item><item><title><![CDATA[面试编程知识+算法题总结（一）]]></title><link>https://blog.youkuaiyun.com/leonharddt/article/details/75372605</link><guid>https://blog.youkuaiyun.com/leonharddt/article/details/75372605</guid><author>leonharddt</author><pubDate>Wed, 19 Jul 2017 14:19:34 +0800</pubDate><description><![CDATA[一、C++中引用和指针的区别1. 指针是一个变量，存储的是一个地址，指向内存的一个存储单元；而引用跟原变量本质是一样的，只不过是原变量的一个别名2. 指针可以为const；引用不可为const3. 指针可以为多级；引用不可为多级；4. 指针可以为空；引用不可为空，并且定义的时候必须初始化5. 指针在初始化后可以改变；引用在初始化后不可改变6. sizeof引用得到的是对象的大小；而sizeof指针...]]></description><category></category></item><item><title><![CDATA[C++奇技淫巧（一）：取位数，交换，比较，求均值]]></title><link>https://blog.youkuaiyun.com/leonharddt/article/details/75093178</link><guid>https://blog.youkuaiyun.com/leonharddt/article/details/75093178</guid><author>leonharddt</author><pubDate>Sat, 15 Jul 2017 14:58:14 +0800</pubDate><description><![CDATA[一、计算一个数转化成二进制后包含1的位数
写法：判断x&(x-1)计算了几次
程序：
int func(int x)
{
    int count = 0;
    while(x){
        count++;
        x = x&(x - 1);
    }
    return count;
}
牛逼！！！
————————————————


二、编程风格]]></description><category></category></item><item><title><![CDATA[[Easy]C++ 第一期 6道]]></title><link>https://blog.youkuaiyun.com/leonharddt/article/details/75009358</link><guid>https://blog.youkuaiyun.com/leonharddt/article/details/75009358</guid><author>leonharddt</author><pubDate>Wed, 12 Jul 2017 14:08:25 +0800</pubDate><description><![CDATA[400. Nth Digit正整数列的第n位数Find the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ...Note:n is positive and will fit within the range of a 32-bit signed integer (n &amp;lt; 231...]]></description><category></category></item></channel></rss>