<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[specialshoot的博客]]></title><description><![CDATA[学无止境]]></description><link>https://blog.youkuaiyun.com/specialshoot</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; specialshoot]]></copyright><item><title><![CDATA[ubuntu18.04 ffmpeg 4.1编译安装（共享库）]]></title><link>https://blog.youkuaiyun.com/specialshoot/article/details/85239956</link><guid>https://blog.youkuaiyun.com/specialshoot/article/details/85239956</guid><author>specialshoot</author><pubDate>Mon, 24 Dec 2018 23:16:25 +0800</pubDate><description><![CDATA[官方文档（不能生成共享库）：

https://trac.ffmpeg.org/wiki/CompilationGuide/Ubuntu#RevertingChangesMadebyThisGuide
参考优快云：https://blog.youkuaiyun.com/u010821666/article/details/74905654


为什么官方文档不能生成共享库？

官方文档安装ffmpeg依赖库...]]></description><category></category></item><item><title><![CDATA[pycharm及idea系列序列号]]></title><link>https://blog.youkuaiyun.com/specialshoot/article/details/70707497</link><guid>https://blog.youkuaiyun.com/specialshoot/article/details/70707497</guid><author>specialshoot</author><pubDate>Tue, 25 Apr 2017 11:52:47 +0800</pubDate><description><![CDATA[2017.4.25
新序列号也被封了,从http://idea.lanyus.com/获取注册码,并在按照上述网站中的要求在hosts加入相应内容即可]]></description><category></category></item><item><title><![CDATA[Ubuntu下关于安装opencv3.x时一直downloading protobuf-cpp-3.1的问题]]></title><link>https://blog.youkuaiyun.com/specialshoot/article/details/55051666</link><guid>https://blog.youkuaiyun.com/specialshoot/article/details/55051666</guid><author>specialshoot</author><pubDate>Mon, 13 Feb 2017 18:57:56 +0800</pubDate><description><![CDATA[1.将protobuf-cpp-3.1.0.tar.gz下载下来,下载地址:
http://download.youkuaiyun.com/detail/specialshoot/9753560

2.按照下载页面上的提示操作即可,我把方法直接写在提示上了,千万不要自己编译安装protobuf这个tar.gz文件,编译时间很长,然后并没有什么卵用,按照提示做,一会儿就好了!
附录:ubuntu中安装多]]></description><category></category></item><item><title><![CDATA[c#网络编程之TCP/IP（二）Thread方式服务器端编写]]></title><link>https://blog.youkuaiyun.com/specialshoot/article/details/51382576</link><guid>https://blog.youkuaiyun.com/specialshoot/article/details/51382576</guid><author>specialshoot</author><pubDate>Thu, 12 May 2016 16:04:46 +0800</pubDate><description><![CDATA[用户类：User.cs
先上代码：using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Net.Sockets;
using System.Text;
using System.Threading;
using System.Threading.Tasks;]]></description><category></category></item><item><title><![CDATA[c#网络编程之TCP/IP（一）C#线程任务基础Thread]]></title><link>https://blog.youkuaiyun.com/specialshoot/article/details/51379076</link><guid>https://blog.youkuaiyun.com/specialshoot/article/details/51379076</guid><author>specialshoot</author><pubDate>Thu, 12 May 2016 11:14:51 +0800</pubDate><description><![CDATA[这些日子很忙，太多的任务。今天把c#tcp/ip完善了一下，两种方式进行TCP/IP通信，一种是多线程，一种是多任务。之前看了c#之网络编程这本书，启发很大，但是里面的demo有很多很多的问题，以后我会一一讲述。再完善书上TCP/IP的历程中的逻辑不合理和bug的前提下，加入了心跳包发送机制，这一点c#有一个坑，回来慢慢给大家讲。
工欲善其事必先利其器，首先我们将一下C#的线程基础。]]></description><category></category></item><item><title><![CDATA[leetcode(198)(213) HouseRobber HouseRobber-II]]></title><link>https://blog.youkuaiyun.com/specialshoot/article/details/50848276</link><guid>https://blog.youkuaiyun.com/specialshoot/article/details/50848276</guid><author>specialshoot</author><pubDate>Thu, 10 Mar 2016 17:49:42 +0800</pubDate><description><![CDATA[原题链接：
https://leetcode.com/problems/house-robber/

https://leetcode.com/problems/house-robber-ii/

第一题题意是一个贼要偷东西，有n户人家，如果偷相邻两家，就会触发警报。警报一响，警察来抓，逮走（做贼不容易啊）。问怎样在不触发警报而偷走最多的钱。
第二题在第一题基础上有加了个收尾相连，即偷]]></description><category></category></item><item><title><![CDATA[leetcode(166) Fraction to Recurring Decimal]]></title><link>https://blog.youkuaiyun.com/specialshoot/article/details/50846325</link><guid>https://blog.youkuaiyun.com/specialshoot/article/details/50846325</guid><author>specialshoot</author><pubDate>Thu, 10 Mar 2016 15:30:04 +0800</pubDate><description><![CDATA[原题链接：https://leetcode.com/problems/fraction-to-recurring-decimal/
这道题就是做除法，然后如果有无限循环的部分用括号表示
比如1/3=0.3333...用0.(3)来表示，1234/9999=0.123412341234....用0.(1234)来表示
循环判断用一个map来查看前面的一个数（或一串数）是否与后面的一个数（或一串]]></description><category></category></item><item><title><![CDATA[leetcode(121)(122)(123)(188) Best Time to Buy and Sell Stock I/II/III/IV JAVA代码]]></title><link>https://blog.youkuaiyun.com/specialshoot/article/details/50823282</link><guid>https://blog.youkuaiyun.com/specialshoot/article/details/50823282</guid><author>specialshoot</author><pubDate>Tue, 08 Mar 2016 10:51:47 +0800</pubDate><description><![CDATA[原题链接:
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-I
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-II
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-]]></description><category></category></item><item><title><![CDATA[java观察者模式（一）]]></title><link>https://blog.youkuaiyun.com/specialshoot/article/details/50804304</link><guid>https://blog.youkuaiyun.com/specialshoot/article/details/50804304</guid><author>specialshoot</author><pubDate>Fri, 04 Mar 2016 21:49:41 +0800</pubDate><description><![CDATA[首先，本博客是根据http://www.imooc.com/learn/415 这个教学后的一些记录。方便以后回顾。

观察者模式，有时被称作发布/订阅模式，观察者模式定义了一种一对多的依赖关系，让多个观察者对象同时监听某一个主题对象。这个主题对象在状态发生变化时，会通知所有观察者对象，使它们能够自动更新自己。
上面说的还是比较抽象，举个例子，一个苦逼的程序员黄明要给老妈和女朋友发送每天的天]]></description><category></category></item><item><title><![CDATA[android通讯录实例（二）]]></title><link>https://blog.youkuaiyun.com/specialshoot/article/details/50786358</link><guid>https://blog.youkuaiyun.com/specialshoot/article/details/50786358</guid><author>specialshoot</author><pubDate>Fri, 04 Mar 2016 11:33:39 +0800</pubDate><description><![CDATA[上一篇android通讯录实例（一）地址：http://blog.youkuaiyun.com/specialshoot/article/details/50651080
这一此我们把UI上最重要的部分IndexableListView说明，这个项目可以在github上找到。https://github.com/woozzu/IndexableListView
源码下载下来我们发现核心代码有两片，Inde]]></description><category></category></item><item><title><![CDATA[leetcode(32) Longest Valid Parentheses]]></title><link>https://blog.youkuaiyun.com/specialshoot/article/details/50755601</link><guid>https://blog.youkuaiyun.com/specialshoot/article/details/50755601</guid><author>specialshoot</author><pubDate>Sat, 27 Feb 2016 16:28:22 +0800</pubDate><description><![CDATA[原题链接:https://leetcode.com/problems/longest-valid-parentheses/
找到最多数量的()匹配
思路:遇到左括号将左括号标号入栈,遇到右括号的情况下分两种情况:
1.如果前面的左括号栈为空,说明前面已经没有左括号了,此时右括号无效,需要重新定位start数值
2.如果前面的左括号栈不为空,这时要把这个左括号下标出栈,若为此时栈为空则max]]></description><category></category></item><item><title><![CDATA[Linux TCP/IP Socket编程]]></title><link>https://blog.youkuaiyun.com/specialshoot/article/details/50716691</link><guid>https://blog.youkuaiyun.com/specialshoot/article/details/50716691</guid><author>specialshoot</author><pubDate>Tue, 23 Feb 2016 11:38:09 +0800</pubDate><description><![CDATA[一.Socket TCP/IP流程图


socket流程图
二.关键数据结构/结构体
sockaddr_in
在列出sockaddr_in结构体之前先将sockaddr结构体说明，此数据结构用作bind、connect、recvfrom、sendto等函数的参数，指明地址信息。sockaddr定义如下：
struct sockaddr {
    unsigned short sa]]></description><category></category></item><item><title><![CDATA[Linux下串口通信详解（下）读写串口及关闭串口]]></title><link>https://blog.youkuaiyun.com/specialshoot/article/details/50709257</link><guid>https://blog.youkuaiyun.com/specialshoot/article/details/50709257</guid><author>specialshoot</author><pubDate>Mon, 22 Feb 2016 12:08:32 +0800</pubDate><description><![CDATA[上一篇博客是串口的打开及配置，博客链接http://blog.youkuaiyun.com/specialshoot/article/details/50707965
这一篇我将要把读写串口及串口关闭的操作详细介绍一下。
读串口
读串口就是接收串口数据，通过read来实现。
read函数原型：
#include     
ssize_t read(int fd, void *buf, size_t]]></description><category></category></item><item><title><![CDATA[Linux下串口通信详解（上）打开串口和串口初始化详解]]></title><link>https://blog.youkuaiyun.com/specialshoot/article/details/50707965</link><guid>https://blog.youkuaiyun.com/specialshoot/article/details/50707965</guid><author>specialshoot</author><pubDate>Sun, 21 Feb 2016 17:03:21 +0800</pubDate><description><![CDATA[linux下串口通信主要有下面几个步骤



串口通信流程图
下面我会一一介绍这几个步骤。
1.打开串口
代码（串口为ttyUSB0）
//打开串口
int open_port(void)
{
	int fd;
		
	fd=open("/dev/ttyUSB0",O_RDWR | O_NOCTTY | O_NONBLOCK);
//	printf("fd=%d\n",fd);]]></description><category></category></item><item><title><![CDATA[leetcode(92) Reverse Linked List II]]></title><link>https://blog.youkuaiyun.com/specialshoot/article/details/50706048</link><guid>https://blog.youkuaiyun.com/specialshoot/article/details/50706048</guid><author>specialshoot</author><pubDate>Sat, 20 Feb 2016 21:10:59 +0800</pubDate><description><![CDATA[原题链接：https://leetcode.com/problems/reverse-linked-list-ii/


Reverse a linked list from position m to n. Do it in-place and in one-pass.

For example:
Given 1->2->3->4->5->NULL, m = 2 and n = 4,]]></description><category></category></item><item><title><![CDATA[leetcode(304) Range Sum Query 2D - Immutable]]></title><link>https://blog.youkuaiyun.com/specialshoot/article/details/50705767</link><guid>https://blog.youkuaiyun.com/specialshoot/article/details/50705767</guid><author>specialshoot</author><pubDate>Sat, 20 Feb 2016 19:33:22 +0800</pubDate><description><![CDATA[题目链接：https://leetcode.com/problems/range-sum-query-2d-immutable/


Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lowe]]></description><category></category></item><item><title><![CDATA[android推送，androidpn项目分析及完善学习笔记(三) XMPP协议]]></title><link>https://blog.youkuaiyun.com/specialshoot/article/details/50703971</link><guid>https://blog.youkuaiyun.com/specialshoot/article/details/50703971</guid><author>specialshoot</author><pubDate>Sat, 20 Feb 2016 16:32:56 +0800</pubDate><description><![CDATA[XMPP协议
简介
XMPP全称为可扩展通讯和表示协议，是一种基于标准通用标记语言的子集XML的协议，它继承了在XML环境中灵活的发展性。因此，基于XMPP的应用具有超强的可扩展性。经过扩展以后的XMPP可以通过发送扩展的信息来处理用户的需求，以及在XMPP的顶端建立如内容发布系统和基于地址的服务等应用程序。而且，XMPP包含了针对服务器端的软件协议，使之能与另一个进行通话，这使得开发者更容易]]></description><category></category></item><item><title><![CDATA[android推送，androidpn项目分析及完善学习笔记(二) Mina]]></title><link>https://blog.youkuaiyun.com/specialshoot/article/details/50684912</link><guid>https://blog.youkuaiyun.com/specialshoot/article/details/50684912</guid><author>specialshoot</author><pubDate>Sat, 20 Feb 2016 10:50:52 +0800</pubDate><description><![CDATA[上回说道，socket是基本的网络通讯方式，然而，真正的工程考虑到高并发性、高可靠性等要求，基本的socket是肯定无法用到项目上的。好在Apache开发出了一套高性能和高可用性的网络应用程序框架，这个框架就是大名鼎鼎的Mina框架。
废话不多说，首先Mina的jar包大家可以从http://mina.apache.org/downloads-mina.html上下载最新版本，我用的是2.0.9]]></description><category></category></item><item><title><![CDATA[ROS(机器人操作系统)学习（二）ROS文件系统]]></title><link>https://blog.youkuaiyun.com/specialshoot/article/details/50679500</link><guid>https://blog.youkuaiyun.com/specialshoot/article/details/50679500</guid><author>specialshoot</author><pubDate>Wed, 17 Feb 2016 12:15:57 +0800</pubDate><description><![CDATA[ROS WIKI：http://wiki.ros.org/ROS/Tutorials/NavigatingTheFilesystem
1.准备
您需要先安装tutorals]]></description><category></category></item><item><title><![CDATA[android推送，androidpn项目分析及完善学习笔记(一) Socket]]></title><link>https://blog.youkuaiyun.com/specialshoot/article/details/50678374</link><guid>https://blog.youkuaiyun.com/specialshoot/article/details/50678374</guid><author>specialshoot</author><pubDate>Wed, 17 Feb 2016 11:38:07 +0800</pubDate><description><![CDATA[放假研究了一下androidpn项目，看看网上的一些经验，觉得有必要记录下来供以后参考。
言归正传，androidpn是做什么用的呢？androidpn (Android Push Notification)是一个基于XMPP协议的java开源Android push notification实现。它包含了完整的客户端和服务器端。这个项目的原作者是一个韩国人，由于国外可以用谷歌的GCM，所以对这]]></description><category></category></item></channel></rss>