<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[唐辰砂的博客]]></title><description><![CDATA[唯代码与BUG不可辜负]]></description><link>https://blog.youkuaiyun.com/Leaf1990</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Leaf1990]]></copyright><item><title><![CDATA[ffmpeg Documentation-4&5 Stream selection and specifiers]]></title><link>https://blog.youkuaiyun.com/Leaf1990/article/details/53170565</link><guid>https://blog.youkuaiyun.com/Leaf1990/article/details/53170565</guid><author>Leaf1990</author><pubDate>Tue, 15 Nov 2016 13:58:10 +0800</pubDate><description><![CDATA[ffmpeg官方文档第4章和第5.1章官方文档链接：https://ffmpeg.org/ffmpeg-all.html#Options4 Stream selection 
4 流选择 
By default, ffmpeg includes only one stream of each type (video, audio, subtitle) present in the input fil]]></description><category></category></item><item><title><![CDATA[ffmpeg Documentation-3 滤波器]]></title><link>https://blog.youkuaiyun.com/Leaf1990/article/details/53116999</link><guid>https://blog.youkuaiyun.com/Leaf1990/article/details/53116999</guid><author>Leaf1990</author><pubDate>Thu, 10 Nov 2016 16:26:04 +0800</pubDate><description><![CDATA[ffmpeg 官方文档第三章]]></description><category></category></item><item><title><![CDATA[ffmpeg Documentation-1 简介]]></title><link>https://blog.youkuaiyun.com/Leaf1990/article/details/53116471</link><guid>https://blog.youkuaiyun.com/Leaf1990/article/details/53116471</guid><author>Leaf1990</author><pubDate>Thu, 10 Nov 2016 16:04:43 +0800</pubDate><description><![CDATA[最近因工作原因，开始接触ffmpeg，发现中文版资料较少，所以想自己翻译一下官方文档，一方面是方便后续查找，一方面是督促自己学习。
附上官方原文链接：https://ffmpeg.org/ffmpeg-all.html
翻译过程中查阅了很多前辈的资料，感谢他们，尤其感谢雷神的系列文章，愿天堂也有所爱。附上雷神文章入口：
http://blog.youkuaiyun.com/leixiaohua1020/]]></description><category></category></item><item><title><![CDATA[Process.waitFor()]]></title><link>https://blog.youkuaiyun.com/Leaf1990/article/details/53009406</link><guid>https://blog.youkuaiyun.com/Leaf1990/article/details/53009406</guid><author>Leaf1990</author><pubDate>Wed, 02 Nov 2016 16:49:24 +0800</pubDate><description><![CDATA[在Java程序中，经常会遇到需要执行外部命令的情况，此时可以使用Runtime.getRuntime().exec(commands)。
场景：java程序中需要执行shell命令
代码：
  Process process = Runtime.getRuntime().exec(commands);
  // 重定向错误输出
            StreamRedirect err]]></description><category></category></item><item><title><![CDATA[@Override annotation 错误]]></title><link>https://blog.youkuaiyun.com/Leaf1990/article/details/53006697</link><guid>https://blog.youkuaiyun.com/Leaf1990/article/details/53006697</guid><author>Leaf1990</author><pubDate>Wed, 02 Nov 2016 12:01:13 +0800</pubDate><description><![CDATA[项目导入eclipse后，implements类中的方法出现如下错误：
The method of  xxx  type must override a superclass? annotation：@Override
原因及解决办法
1、在jdk1.5下要使用@Override
 这个annotation 必须保证 被标注方法来源于class 而不是interface。
2、检查项目的]]></description><category></category></item><item><title><![CDATA[Cannot change version of project facet Dynamic Web Module to 2.5]]></title><link>https://blog.youkuaiyun.com/Leaf1990/article/details/52037212</link><guid>https://blog.youkuaiyun.com/Leaf1990/article/details/52037212</guid><author>Leaf1990</author><pubDate>Tue, 26 Jul 2016 16:39:31 +0800</pubDate><description><![CDATA[问题：Cannot change version of project facet Dynamic Web Module to 2.5
解决办法：
1、确认web.xml中是2.5

<web-app xmlns="http://java.sun.com/xml/ns/javaee"
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-]]></description><category></category></item><item><title><![CDATA[maven update error：Cannot nest 'xxx/WEB-INF/classes' inside 'xxx']]></title><link>https://blog.youkuaiyun.com/Leaf1990/article/details/52034007</link><guid>https://blog.youkuaiyun.com/Leaf1990/article/details/52034007</guid><author>Leaf1990</author><pubDate>Tue, 26 Jul 2016 11:19:55 +0800</pubDate><description><![CDATA[maven update 错误：

Cannot nest 'final/src/main/webapp/WEB-INF/classes'
 inside 'final/src'




解决办法：

查看pom.xml中是否有xxx属性

删除sourceDirectory属性]]></description><category></category></item><item><title><![CDATA[【leetcode】Linked List Cycle]]></title><link>https://blog.youkuaiyun.com/Leaf1990/article/details/46376915</link><guid>https://blog.youkuaiyun.com/Leaf1990/article/details/46376915</guid><author>Leaf1990</author><pubDate>Fri, 05 Jun 2015 14:53:18 +0800</pubDate><description><![CDATA[//两个指针slow和fast，都从链表头开始走，s每次走一步，f每次走两步，等两个指针重合时，就说明有环，否则没有

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x)]]></description><category></category></item><item><title><![CDATA[【leetcode】Linked List Cycle II]]></title><link>https://blog.youkuaiyun.com/Leaf1990/article/details/46376767</link><guid>https://blog.youkuaiyun.com/Leaf1990/article/details/46376767</guid><author>Leaf1990</author><pubDate>Fri, 05 Jun 2015 14:45:36 +0800</pubDate><description><![CDATA[/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
//两个指针slow和fast，都从链表头开始走，s每次走一步，f]]></description><category></category></item><item><title><![CDATA[【leetcode】Reorder List]]></title><link>https://blog.youkuaiyun.com/Leaf1990/article/details/46376299</link><guid>https://blog.youkuaiyun.com/Leaf1990/article/details/46376299</guid><author>Leaf1990</author><pubDate>Fri, 05 Jun 2015 14:14:13 +0800</pubDate><description><![CDATA[Given a singly linked list L: L0→L1→…→Ln-1→Ln,
reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…

You must do this in-place without altering the nodes' values.

For example,
Given {1,2,3,4}, reorder it to ]]></description><category></category></item><item><title><![CDATA[【leetcode】Binary Tree Preorder Traversal]]></title><link>https://blog.youkuaiyun.com/Leaf1990/article/details/46374335</link><guid>https://blog.youkuaiyun.com/Leaf1990/article/details/46374335</guid><author>Leaf1990</author><pubDate>Fri, 05 Jun 2015 11:15:44 +0800</pubDate><description><![CDATA[/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };]]></description><category></category></item><item><title><![CDATA[【leetcode】3sums]]></title><link>https://blog.youkuaiyun.com/Leaf1990/article/details/46373911</link><guid>https://blog.youkuaiyun.com/Leaf1990/article/details/46373911</guid><author>Leaf1990</author><pubDate>Fri, 05 Jun 2015 10:59:23 +0800</pubDate><description><![CDATA[Given an array S of n integers, are there elements a, b, c in S such
 that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.

Note:


Elements in a triplet (a,b,c]]></description><category></category></item><item><title><![CDATA[【leetcode】Course Schedule II]]></title><link>https://blog.youkuaiyun.com/Leaf1990/article/details/46372909</link><guid>https://blog.youkuaiyun.com/Leaf1990/article/details/46372909</guid><author>Leaf1990</author><pubDate>Fri, 05 Jun 2015 10:16:20 +0800</pubDate><description><![CDATA[There are a total of n courses you have to take, labeled from 0 to n
 - 1.

Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as ]]></description><category></category></item><item><title><![CDATA[【leetcode】Insertion Sort List]]></title><link>https://blog.youkuaiyun.com/Leaf1990/article/details/46360231</link><guid>https://blog.youkuaiyun.com/Leaf1990/article/details/46360231</guid><author>Leaf1990</author><pubDate>Thu, 04 Jun 2015 13:58:13 +0800</pubDate><description><![CDATA[Sort a linked list using insertion sort.
建立一个新头结点，然后依次将head链表中的结点有序的插入到新链表中
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode]]></description><category></category></item><item><title><![CDATA[【leetcode】Sort List]]></title><link>https://blog.youkuaiyun.com/Leaf1990/article/details/46356529</link><guid>https://blog.youkuaiyun.com/Leaf1990/article/details/46356529</guid><author>Leaf1990</author><pubDate>Thu, 04 Jun 2015 10:03:08 +0800</pubDate><description><![CDATA[Sort a linked list in O(n log n)
 time using constant space complexity.



题目要求：对一个链表进行归并排序。
基本思想：
1：利用归并排序的整体思想
2：找到一个链表的中间节点的方法
3：合并两个已排好序的链表为一个新的有序链表



/**
 * Definition for singly-l]]></description><category></category></item></channel></rss>