<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[KAKADEE BLOG]]></title><description><![CDATA[stay young, stay simple.]]></description><link>https://blog.youkuaiyun.com/csdn_lisword</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; csdn_lisword]]></copyright><item><title><![CDATA[快速搭建多终端同步的 github + hexo 静态博客]]></title><link>https://blog.youkuaiyun.com/csdn_lisword/article/details/73804982</link><guid>https://blog.youkuaiyun.com/csdn_lisword/article/details/73804982</guid><author>csdn_lisword</author><pubDate>Tue, 27 Jun 2017 17:09:09 +0800</pubDate><description><![CDATA[快速搭建多终端同步的 github + hexo 静态博客最近心血来潮想搭建自己的个人博客，在考察了多种博客的搭建方法后，毅然选择了 GitHub + hexo 的静态博客搭建方法（主要原因是对我来说比较简单）。本人工作机是在Mac,所以主要搭建环境与配置是在OSX系统下进行，与Linux应该区别不大，windows环境下的配置可能有出入，敬请谅解。最终实现的效果是在GitHub上只需要一个仓库，实]]></description><category></category></item><item><title><![CDATA[Swift 3.0 学习笔记-5-函数]]></title><link>https://blog.youkuaiyun.com/csdn_lisword/article/details/70238042</link><guid>https://blog.youkuaiyun.com/csdn_lisword/article/details/70238042</guid><author>csdn_lisword</author><pubDate>Wed, 19 Apr 2017 10:54:57 +0800</pubDate><description><![CDATA[Swift 3.0 学习笔记-5-函数标签（空格分隔）： iOS Swift前言： 
swift3.0 学习笔记主要参考苹果开发者官网The Swift Programming Language (Swift 3.1)教程 以及 Swift 中文网。 
更纯粹的阅读的体验请移步至： 
https://www.zybuluo.com/kakadee/note/727524Swift 30 学习笔记-5]]></description><category></category></item><item><title><![CDATA[Swift 3.0 学习笔记-4-控制流]]></title><link>https://blog.youkuaiyun.com/csdn_lisword/article/details/70225506</link><guid>https://blog.youkuaiyun.com/csdn_lisword/article/details/70225506</guid><author>csdn_lisword</author><pubDate>Tue, 18 Apr 2017 10:33:16 +0800</pubDate><description><![CDATA[Swift 3.0 学习笔记-4-控制流标签（空格分隔）： iOS Swift前言： 
swift3.0 学习笔记主要参考苹果开发者官网The Swift Programming Language (Swift 3.1)教程 以及 Swift 中文网。 
更纯粹的阅读的体验请移步至： 
https://www.zybuluo.com/kakadee/note/726184Swift 30 学习笔记-]]></description><category></category></item><item><title><![CDATA[Swift 3.0 学习笔记-3-集合类型]]></title><link>https://blog.youkuaiyun.com/csdn_lisword/article/details/70175369</link><guid>https://blog.youkuaiyun.com/csdn_lisword/article/details/70175369</guid><author>csdn_lisword</author><pubDate>Fri, 14 Apr 2017 19:28:43 +0800</pubDate><description><![CDATA[Swift 3.0 学习笔记-3-集合类型标签（空格分隔）： iOS Swift前言： 
swift3.0 学习笔记主要参考苹果开发者官网The Swift Programming Language (Swift 3.1)教程 以及 Swift 中文网。 
更纯粹的阅读的体验请移步至： 
https://www.zybuluo.com/kakadee/note/721367Swift 30 学习笔记]]></description><category></category></item><item><title><![CDATA[Swift 3.0 学习笔记-2-字符串和Unicode]]></title><link>https://blog.youkuaiyun.com/csdn_lisword/article/details/70159588</link><guid>https://blog.youkuaiyun.com/csdn_lisword/article/details/70159588</guid><author>csdn_lisword</author><pubDate>Thu, 13 Apr 2017 16:48:34 +0800</pubDate><description><![CDATA[Swift 3.0 学习笔记-2-字符串和Unicode标签（空格分隔）： iOS Swift声明 
Swift 3.0 学习笔记主要参考苹果开发者官网[The Swift Programming Language (Swift 3.1)教程][1] 以及 [Swift 中文网][2]。Swift 30 学习笔记-2-字符串和Unicode
字符串String
1 字符串字面量
2 初始化空字符串]]></description><category></category></item><item><title><![CDATA[Swift 3.0 学习笔记-1-基础语法]]></title><link>https://blog.youkuaiyun.com/csdn_lisword/article/details/70157169</link><guid>https://blog.youkuaiyun.com/csdn_lisword/article/details/70157169</guid><author>csdn_lisword</author><pubDate>Thu, 13 Apr 2017 13:23:49 +0800</pubDate><description><![CDATA[Swift 3.0 学习笔记-1-基础语法标签（空格分隔）： iOS Swift声明swift3.0 学习笔记主要参考苹果开发者官网The Swift Programming Language (Swift 3.1)教程 以及 Swift 中文网。1 常量和变量 (let & var)1.1 声明常量和变量let来声明常量，用var来声明变量。// 常量：
let maximumNumberOfLo]]></description><category></category></item><item><title><![CDATA[TensorFlow的安装]]></title><link>https://blog.youkuaiyun.com/csdn_lisword/article/details/55506765</link><guid>https://blog.youkuaiyun.com/csdn_lisword/article/details/55506765</guid><author>csdn_lisword</author><pubDate>Fri, 17 Feb 2017 12:23:29 +0800</pubDate><description><![CDATA[TensorFlow的安装标签（空格分隔）：TensorFlow1. 前提说明在公司试着学习下深度学习项目，决定使用TensorFlow框架，公司的服务器上之前有人搭建过，遇到不懂的也也可以顺便请教。至于为什么还要自己重新搭建一个，因为公司的TensorFlow可能版本较老，在运行mnist的深度学习模型不能运行，所以还得自己重新装一个。 
先说明一下现有的条件吧，
服务器系统为Linux
有NVI]]></description><category></category></item><item><title><![CDATA[二叉树的常见算法1]]></title><link>https://blog.youkuaiyun.com/csdn_lisword/article/details/51893190</link><guid>https://blog.youkuaiyun.com/csdn_lisword/article/details/51893190</guid><author>csdn_lisword</author><pubDate>Tue, 12 Jul 2016 22:34:33 +0800</pubDate><description><![CDATA[二叉树的常见算法
11. 二叉树的存储结构struct TreeNode
{
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};2. 根据字符串创建一颗二叉树1. 描述给你一串字符串，每个节点用‘,’隔开，用‘#’代表空的字符串]]></description><category></category></item><item><title><![CDATA[八大排序算法]]></title><link>https://blog.youkuaiyun.com/csdn_lisword/article/details/51785474</link><guid>https://blog.youkuaiyun.com/csdn_lisword/article/details/51785474</guid><author>csdn_lisword</author><pubDate>Wed, 29 Jun 2016 19:52:38 +0800</pubDate><description><![CDATA[八大排序算法标签：算法 查找和排序1. 插入排序—直接插入排序   ( 稳定的 O(nlogn) )基本思想: 将一个记录插入到已排序好的有序表中，从而得到一个新，记录数增1的有序表。即：先将序列的第1个记录看成是一个有序的子序列，然后从第2个记录逐个进行插入，直至整个序列有序为止。要点：设立哨兵，作为临时存储和判断数组边界之用。如果碰见一个和插入元素相等的，那么插入元素把想插入的元素放在相等元素的]]></description><category></category></item><item><title><![CDATA[欢迎使用优快云-markdown编辑器]]></title><link>https://blog.youkuaiyun.com/csdn_lisword/article/details/51558864</link><guid>https://blog.youkuaiyun.com/csdn_lisword/article/details/51558864</guid><author>csdn_lisword</author><pubDate>Wed, 01 Jun 2016 20:42:45 +0800</pubDate><description><![CDATA[欢迎使用 Cmd Markdown 编辑阅读器#include <iostream>
using namespace std;
我们理解您需要更便捷更高效的工具记录思想，整理笔记、知识，并将其中承载的价值传播给他人，Cmd Markdown 是我们给出的答案 —— 我们为记录思想和分享知识提供更专业的工具。 您可以使用 Cmd Markdown：
  
  整理知识，学习笔记
  发布日记，杂文，所]]></description><category></category></item><item><title><![CDATA[leetcode 41. First Missing Positive]]></title><link>https://blog.youkuaiyun.com/csdn_lisword/article/details/51161733</link><guid>https://blog.youkuaiyun.com/csdn_lisword/article/details/51161733</guid><author>csdn_lisword</author><pubDate>Fri, 15 Apr 2016 15:06:15 +0800</pubDate><description><![CDATA[1.题目
































Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where
 the candidate numbe]]></description><category></category></item><item><title><![CDATA[leetcode 40. Combination Sum II]]></title><link>https://blog.youkuaiyun.com/csdn_lisword/article/details/51144616</link><guid>https://blog.youkuaiyun.com/csdn_lisword/article/details/51144616</guid><author>csdn_lisword</author><pubDate>Wed, 13 Apr 2016 16:38:20 +0800</pubDate><description><![CDATA[1.题目
































Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where
 the candidate numbe]]></description><category></category></item><item><title><![CDATA[leetcode 39. Combination Sum]]></title><link>https://blog.youkuaiyun.com/csdn_lisword/article/details/51144579</link><guid>https://blog.youkuaiyun.com/csdn_lisword/article/details/51144579</guid><author>csdn_lisword</author><pubDate>Wed, 13 Apr 2016 16:32:51 +0800</pubDate><description><![CDATA[1.题目






























Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where
 the candidate numbers sums to ]]></description><category></category></item><item><title><![CDATA[leetcode 38. Count and Say]]></title><link>https://blog.youkuaiyun.com/csdn_lisword/article/details/51143938</link><guid>https://blog.youkuaiyun.com/csdn_lisword/article/details/51143938</guid><author>csdn_lisword</author><pubDate>Wed, 13 Apr 2016 15:41:50 +0800</pubDate><description><![CDATA[1.题目




























The count-and-say sequence is the sequence of integers beginning as follows:
1, 11, 21, 1211, 111221, ...

1 is read off as "one
 1" o]]></description><category></category></item><item><title><![CDATA[leetcode 37. Sudoku Solver]]></title><link>https://blog.youkuaiyun.com/csdn_lisword/article/details/51143534</link><guid>https://blog.youkuaiyun.com/csdn_lisword/article/details/51143534</guid><author>csdn_lisword</author><pubDate>Wed, 13 Apr 2016 15:15:13 +0800</pubDate><description><![CDATA[1.题目




























Write a program to solve a Sudoku puzzle by filling the empty cells.

Empty cells are indicated by the character '.'.

You may assume ]]></description><category></category></item><item><title><![CDATA[leetcode 36. Valid Sudoku]]></title><link>https://blog.youkuaiyun.com/csdn_lisword/article/details/51143516</link><guid>https://blog.youkuaiyun.com/csdn_lisword/article/details/51143516</guid><author>csdn_lisword</author><pubDate>Wed, 13 Apr 2016 14:59:40 +0800</pubDate><description><![CDATA[1.题目
































Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.

The Sudoku board could be partially filled, where emp]]></description><category></category></item><item><title><![CDATA[leetcode 35. Search Insert Position]]></title><link>https://blog.youkuaiyun.com/csdn_lisword/article/details/51134137</link><guid>https://blog.youkuaiyun.com/csdn_lisword/article/details/51134137</guid><author>csdn_lisword</author><pubDate>Tue, 12 Apr 2016 15:49:04 +0800</pubDate><description><![CDATA[1.题目






























Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it wer]]></description><category></category></item><item><title><![CDATA[leetcode 34. Search for a Range]]></title><link>https://blog.youkuaiyun.com/csdn_lisword/article/details/51134080</link><guid>https://blog.youkuaiyun.com/csdn_lisword/article/details/51134080</guid><author>csdn_lisword</author><pubDate>Tue, 12 Apr 2016 15:44:50 +0800</pubDate><description><![CDATA[1.题目




























Given a sorted array of integers, find the starting and ending position of a given target value.

Your algorithm's runtime complexity mu]]></description><category></category></item><item><title><![CDATA[leetcode 33. Search in Rotated Sorted Array]]></title><link>https://blog.youkuaiyun.com/csdn_lisword/article/details/51133701</link><guid>https://blog.youkuaiyun.com/csdn_lisword/article/details/51133701</guid><author>csdn_lisword</author><pubDate>Tue, 12 Apr 2016 15:30:27 +0800</pubDate><description><![CDATA[1.题目


























Suppose a sorted array is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4
 5 6 7 0 1 2).

You are g]]></description><category></category></item><item><title><![CDATA[leetcode 32. Longest Valid Parentheses]]></title><link>https://blog.youkuaiyun.com/csdn_lisword/article/details/51132696</link><guid>https://blog.youkuaiyun.com/csdn_lisword/article/details/51132696</guid><author>csdn_lisword</author><pubDate>Tue, 12 Apr 2016 14:41:29 +0800</pubDate><description><![CDATA[1.题目
























Given a string containing just the characters '(' and ')',
 find the length of the longest valid (well-formed) parentheses substring.

For "(()]]></description><category></category></item></channel></rss>