<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[LLW059的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/LLW059</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; LLW059]]></copyright><item><title><![CDATA[vim编辑器小结]]></title><link>https://blog.youkuaiyun.com/LLW059/article/details/53318678</link><guid>https://blog.youkuaiyun.com/LLW059/article/details/53318678</guid><author>LLW059</author><pubDate>Thu, 24 Nov 2016 14:19:25 +0800</pubDate><description><![CDATA[1、编辑和保存文件
 
vim分为插入和命令两种模式。在插入模式下可以输入字符，命令模式下则执行除了输入字符之外的所有操作，包括保存、搜索、移动光标等。启动vim时自动处于命令模式，按I(i)键可以进入插入模式，这个命令用于在当前光标所在处插入字符。vim会在左下角提示用户此时所处的模式。
 
按Esc键回到命令模式，此时左下角的"-- 插入 --"提示消失，告诉用户正处于命令模式下。使用]]></description><category></category></item><item><title><![CDATA[Invert Binary Tree]]></title><link>https://blog.youkuaiyun.com/LLW059/article/details/51964792</link><guid>https://blog.youkuaiyun.com/LLW059/article/details/51964792</guid><author>LLW059</author><pubDate>Wed, 20 Jul 2016 08:28:42 +0800</pubDate><description><![CDATA[Invert a binary tree.     4
   /   \
  2     7
 / \   / \
1   3 6   9to     4
   /   \
  7     2
 / \   / \
9   6 3   1递归算法： 
1、交换根节点的左右子树。 
2、对左右子树分别执行递归交换 。代码如下：/**
 * Definition for a binary tree no]]></description><category></category></item><item><title><![CDATA[Lowest Common Ancestor of a Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/LLW059/article/details/51959707</link><guid>https://blog.youkuaiyun.com/LLW059/article/details/51959707</guid><author>LLW059</author><pubDate>Tue, 19 Jul 2016 21:27:01 +0800</pubDate><description><![CDATA[Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two]]></description><category></category></item><item><title><![CDATA[Multiply Strings]]></title><link>https://blog.youkuaiyun.com/LLW059/article/details/51919913</link><guid>https://blog.youkuaiyun.com/LLW059/article/details/51919913</guid><author>LLW059</author><pubDate>Fri, 15 Jul 2016 17:50:14 +0800</pubDate><description><![CDATA[Given two numbers represented as strings, return multiplication of the numbers as a string.Note: 
The numbers can be arbitrarily large and are non-negative. 
Converting the input string to integer is N]]></description><category></category></item><item><title><![CDATA[Basic Calculator II]]></title><link>https://blog.youkuaiyun.com/LLW059/article/details/51914601</link><guid>https://blog.youkuaiyun.com/LLW059/article/details/51914601</guid><author>LLW059</author><pubDate>Fri, 15 Jul 2016 09:10:19 +0800</pubDate><description><![CDATA[Implement a basic calculator to evaluate a simple expression string.The expression string contains only non-negative integers, +, -, *, / operators and empty spaces . The integer division should trunca]]></description><category></category></item><item><title><![CDATA[Valid Palindrome]]></title><link>https://blog.youkuaiyun.com/LLW059/article/details/51901461</link><guid>https://blog.youkuaiyun.com/LLW059/article/details/51901461</guid><author>LLW059</author><pubDate>Wed, 13 Jul 2016 20:58:07 +0800</pubDate><description><![CDATA[Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example, 
“A man, a plan, a canal: Panama” is a palindrome. 
“race a car” is not a palin]]></description><category></category></item><item><title><![CDATA[Count and Say]]></title><link>https://blog.youkuaiyun.com/LLW059/article/details/51899846</link><guid>https://blog.youkuaiyun.com/LLW059/article/details/51899846</guid><author>LLW059</author><pubDate>Wed, 13 Jul 2016 17:18:00 +0800</pubDate><description><![CDATA[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” or 11. 
11 is read off as “two 1s” or 21. 
21 is read off as “one 2, the]]></description><category></category></item><item><title><![CDATA[String to Integer (atoi)]]></title><link>https://blog.youkuaiyun.com/LLW059/article/details/51894384</link><guid>https://blog.youkuaiyun.com/LLW059/article/details/51894384</guid><author>LLW059</author><pubDate>Wed, 13 Jul 2016 08:16:57 +0800</pubDate><description><![CDATA[Implement atoi to convert a string to an integer.说明：实现的atoi函数需要满足以下特征 
1、忽略字符串第一个非空格字符前的所有空格(whitespace),第一个非空格字符可以是正负号，后面接纯数字，atoi函数将这些纯数字转换为整型并返回； 
3、如果字符串中第一个非空格字符不是一个数字，字符串为空或仅由空格组成，则不对之进行转换； 
3、在数]]></description><category></category></item><item><title><![CDATA[Reverse Vowels of a String]]></title><link>https://blog.youkuaiyun.com/LLW059/article/details/51893113</link><guid>https://blog.youkuaiyun.com/LLW059/article/details/51893113</guid><author>LLW059</author><pubDate>Tue, 12 Jul 2016 22:26:05 +0800</pubDate><description><![CDATA[Write a function that takes a string as input and reverse only the vowels of a string.Example 1: 
Given s = “hello”, return “holle”.Example 2: 
Given s = “leetcode”, return “leotcede”.代码：//遍历字符串，temp数组]]></description><category></category></item><item><title><![CDATA[远程下载嵌入式WEB服务器里的文件]]></title><link>https://blog.youkuaiyun.com/LLW059/article/details/51764854</link><guid>https://blog.youkuaiyun.com/LLW059/article/details/51764854</guid><author>LLW059</author><pubDate>Sun, 26 Jun 2016 22:13:34 +0800</pubDate><description><![CDATA[因项目需要，用S3C2440和GoAhead构建嵌入式WEB服务器。嵌入式设备实时存储数据到SD卡，需要远程下载SD卡存储的数据。编写网页放在嵌入式设备里，在浏览器输入嵌入式设备的IP可以访问网页。 
之前考虑过用链接来下载文件，可是没有成功，后来发现URL写的不对。URL的一般形式为： <协议>://<主机>:<端口>/<路径>。其中，<协议>通常为http协议；<主机>为该主机的域名；<端口>为]]></description><category></category></item><item><title><![CDATA[HexToFloat和HexToDouble]]></title><link>https://blog.youkuaiyun.com/LLW059/article/details/51764522</link><guid>https://blog.youkuaiyun.com/LLW059/article/details/51764522</guid><author>LLW059</author><pubDate>Sun, 26 Jun 2016 21:20:27 +0800</pubDate><description><![CDATA[要明白如何将十六进制转换为float或double，需要了解浮点数的二进制存储和转换方式。float和double在存储方式上都遵从IEEE的规范，且float遵从IEEE R32.24，而double遵从R64.53。具体转换规则可以参考http://www.cnblogs.com/dolphin0520/archive/2011/10/02/2198280.html。按照转换规则，写出HexTo]]></description><category></category></item><item><title><![CDATA[Remove Element]]></title><link>https://blog.youkuaiyun.com/LLW059/article/details/51694622</link><guid>https://blog.youkuaiyun.com/LLW059/article/details/51694622</guid><author>LLW059</author><pubDate>Thu, 16 Jun 2016 20:59:40 +0800</pubDate><description><![CDATA[Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with constant memory.The order]]></description><category></category></item><item><title><![CDATA[Rotate Array]]></title><link>https://blog.youkuaiyun.com/LLW059/article/details/51682140</link><guid>https://blog.youkuaiyun.com/LLW059/article/details/51682140</guid><author>LLW059</author><pubDate>Wed, 15 Jun 2016 14:36:47 +0800</pubDate><description><![CDATA[Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].思路： 
1、以数组右侧第k个元素为界，将一个数组分成两部分。如数组[1,2,3,4,5,6,7]，k=3，则分]]></description><category></category></item><item><title><![CDATA[Contains Duplicate II]]></title><link>https://blog.youkuaiyun.com/LLW059/article/details/51673049</link><guid>https://blog.youkuaiyun.com/LLW059/article/details/51673049</guid><author>LLW059</author><pubDate>Tue, 14 Jun 2016 16:56:53 +0800</pubDate><description><![CDATA[欢迎使用Markdown编辑器写博客本Markdown编辑器使用StackEdit修改而来，用它写博客，将会带来全新的体验哦：
Markdown和扩展Markdown简洁的语法
代码块高亮
图片链接和图片上传
LaTex数学公式
UML序列图和流程图
离线写博客
导入导出Markdown文件
丰富的快捷键
快捷键
加粗    Ctrl + B 
斜体    Ctrl + I 
引用    Ctrl]]></description><category></category></item><item><title><![CDATA[进程间通信1—管道(pipe)和命名管道(FIFO)]]></title><link>https://blog.youkuaiyun.com/LLW059/article/details/50187611</link><guid>https://blog.youkuaiyun.com/LLW059/article/details/50187611</guid><author>LLW059</author><pubDate>Sat, 05 Dec 2015 17:26:25 +0800</pubDate><description><![CDATA[进程间通信(Inter-Process Communication,IPC)是用于处理一个多进程系统中各个进程之间的协调。所谓进程间通信，就是指多个进程间相互通信、交换信息的方法。常见的进程间通信方法包括以下几种：
管道和命名管道
信号
消息队列
共享内存
信号量
套接字
其中，管道和命名管道、信号、消息队列、共享内存和信号量只适用于本地进程间通信，套接字用于远程通信，因而一般用于网络编程，这里不做]]></description><category></category></item><item><title><![CDATA[字符串输入gets()、fgets()和字符串输出puts()、fputs()函数]]></title><link>https://blog.youkuaiyun.com/LLW059/article/details/50062957</link><guid>https://blog.youkuaiyun.com/LLW059/article/details/50062957</guid><author>LLW059</author><pubDate>Thu, 26 Nov 2015 22:42:18 +0800</pubDate><description><![CDATA[一、字符串输入 
        想把字符串读到程序中，必须首先预留存储字符串的空间，然后使用输入函数来获取这个字符串。需要分配足够大的存储区来存放希望读入的字符串，不要指望计算机读的时候会先计算字符串的长度，然后为字符串分配空间。常见错误为： 
        char *name; 
        scanf(“%s”, name); 
        这可能会通过编译，但在读入name的时候]]></description><category></category></item></channel></rss>