<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[nova1729的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/nova1729</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; nova1729]]></copyright><item><title><![CDATA[Huawei LiteOS内核剖析0--启动]]></title><link>https://blog.youkuaiyun.com/nova1729/article/details/52133476</link><guid>https://blog.youkuaiyun.com/nova1729/article/details/52133476</guid><author>nova1729</author><pubDate>Wed, 10 Aug 2016 23:56:25 +0800</pubDate><description><![CDATA[Huawei LiteOS内核剖析0–启动]]></description><category></category></item><item><title><![CDATA[githug mac 安装]]></title><link>https://blog.youkuaiyun.com/nova1729/article/details/50472273</link><guid>https://blog.youkuaiyun.com/nova1729/article/details/50472273</guid><author>nova1729</author><pubDate>Wed, 06 Jan 2016 23:18:32 +0800</pubDate><description><![CDATA[最近在mac上安装了githug，在此处做个记录
具体参考 http://www.cnblogs.com/wicub/p/3646070.html



gem install githug



安装成功后执行下面的命令:

githug --help
Tasks:
githug help [TASK] # Describe available tasks or one]]></description><category></category></item><item><title><![CDATA[Insertion Sort List]]></title><link>https://blog.youkuaiyun.com/nova1729/article/details/39932553</link><guid>https://blog.youkuaiyun.com/nova1729/article/details/39932553</guid><author>nova1729</author><pubDate>Thu, 09 Oct 2014 16:02:47 +0800</pubDate><description><![CDATA[/** * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *ser]]></description><category></category></item><item><title><![CDATA[Max Points on a Line]]></title><link>https://blog.youkuaiyun.com/nova1729/article/details/39697549</link><guid>https://blog.youkuaiyun.com/nova1729/article/details/39697549</guid><author>nova1729</author><pubDate>Tue, 30 Sep 2014 16:31:34 +0800</pubDate><description><![CDATA[Given n points
 on a 2D plane, find the maximum number of points that lie on the same straight line.]]></description><category></category></item><item><title><![CDATA[Leetcode Maximum Product Subarray]]></title><link>https://blog.youkuaiyun.com/nova1729/article/details/39695315</link><guid>https://blog.youkuaiyun.com/nova1729/article/details/39695315</guid><author>nova1729</author><pubDate>Tue, 30 Sep 2014 14:06:02 +0800</pubDate><description><![CDATA[Find the contiguous subarray within an array (containing at least one number) which has the largest product.

For example, given the array [2,3,-2,4],
the contiguous subarray [2,3] has the largest ]]></description><category></category></item><item><title><![CDATA[Leetcode Best Time to Buy and Sell Stock]]></title><link>https://blog.youkuaiyun.com/nova1729/article/details/39694783</link><guid>https://blog.youkuaiyun.com/nova1729/article/details/39694783</guid><author>nova1729</author><pubDate>Tue, 30 Sep 2014 13:19:07 +0800</pubDate><description><![CDATA[class Solution {
public:
    int maxProfit(vector &prices) {
        if ( prices.size() 
        
        int min,profit=0;
        min = prices[0];
        for (int i = 0; i 
        {
     ]]></description><category></category></item><item><title><![CDATA[sama5d3x 启用UART设备]]></title><link>https://blog.youkuaiyun.com/nova1729/article/details/17750905</link><guid>https://blog.youkuaiyun.com/nova1729/article/details/17750905</guid><author>nova1729</author><pubDate>Thu, 02 Jan 2014 10:14:49 +0800</pubDate><description><![CDATA[购买的开发板未使用UART，只能自己硬着头皮添加。但AT91的linux也是过于庞大，所以开始寻找切入点
首先看这篇文章：http://blog.youkuaiyun.com/21cnbao/article/details/8457546
有了这个设备树，问题就简化了，所以在/linux-at91/arch/arm/boot/dts/中看到有：


先看sama5d3.dtsi，如usart0：
]]></description><category></category></item><item><title><![CDATA[嵌入式boawebserver + cgi注意事项]]></title><link>https://blog.youkuaiyun.com/nova1729/article/details/13510043</link><guid>https://blog.youkuaiyun.com/nova1729/article/details/13510043</guid><author>nova1729</author><pubDate>Tue, 29 Oct 2013 17:09:47 +0800</pubDate><description><![CDATA[最近在开发板上移植了boa webserver，直接用cgic和.bash写了查看配置和更改配置的页面，完成效果如下：


现在虚拟机上实现，后移植到开发板
具体步骤：
1.下载源码，编译，配置（网上例子很多，在此不赘述了）
2.下载cgic，编译cgictest程序，放到设定的.../cgi-bin下，在浏览器输入127.0.0.1，看到test页面，OK
3.实现获取linux运]]></description><category></category></item><item><title><![CDATA[Rotate Image]]></title><link>https://blog.youkuaiyun.com/nova1729/article/details/9944473</link><guid>https://blog.youkuaiyun.com/nova1729/article/details/9944473</guid><author>nova1729</author><pubDate>Tue, 13 Aug 2013 11:02:09 +0800</pubDate><description><![CDATA[问题描述：

You are given an n x n 2D
 matrix representing an image.
Rotate the image by 90 degrees (clockwise).
Follow up:
Could you do this in-place?
关键是要空间复杂度O(1)，拿个小矩阵做做实验就知道了。
class Solution {]]></description><category></category></item></channel></rss>