<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[曦酱的思维工厂]]></title><description><![CDATA[相信技术，相信梦想]]></description><link>https://blog.youkuaiyun.com/fair_angle</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; fair_angle]]></copyright><item><title><![CDATA[Window10 terminal美化教程]]></title><link>https://blog.youkuaiyun.com/fair_angle/article/details/123145168</link><guid>https://blog.youkuaiyun.com/fair_angle/article/details/123145168</guid><author>fair_angle</author><pubDate>Sat, 26 Feb 2022 09:16:55 +0800</pubDate><description><![CDATA[参考链接：https://blog.youkuaiyun.com/zhouchen1998/article/details/107484782

主要配置：(需要提前安装git bash)git、背景美化、字体(需要在github下载：CascadiaCode-2009.22.zip）上述链接均有涉及
]]></description><category></category></item><item><title><![CDATA[拉取大型git库技巧]]></title><link>https://blog.youkuaiyun.com/fair_angle/article/details/123145145</link><guid>https://blog.youkuaiyun.com/fair_angle/article/details/123145145</guid><author>fair_angle</author><pubDate>Sat, 26 Feb 2022 09:14:59 +0800</pubDate><description><![CDATA[在项目中有需要拉取诸如tensorflow之类的大型仓库，在拉取时会有一些技巧，具体如下：

方法一：


git config --global core.compression 0
git clone --depth 1 &lt;repo_URI&gt;
# cd to your newly created directory
git fetch --unshallow
git pull --all

来自 &lt;windows - git clone error: RPC failed; curl ]]></description><category></category></item><item><title><![CDATA[Ubuntu16.04 python安装]]></title><link>https://blog.youkuaiyun.com/fair_angle/article/details/123145125</link><guid>https://blog.youkuaiyun.com/fair_angle/article/details/123145125</guid><author>fair_angle</author><pubDate>Sat, 26 Feb 2022 09:12:37 +0800</pubDate><description><![CDATA[背景：由于项目需要，要在Ubuntu16.04的主机上配置python3.7（系统自带的Python为python3.5），同时他不能安装anaconda

输入：

sudo add-apt-repository ppa:jonathonf/python-3.7

坑1：注意前面的软件源是否存在：比如这个就不存在，需要重新下载。

然后：

sudo apt-get update &amp;&amp; sudo apt-get install python3.7

即可

注:软件包会安装在/usr/lo]]></description><category></category></item><item><title><![CDATA[关于RK3399 安装 numpy Illagal instruction]]></title><link>https://blog.youkuaiyun.com/fair_angle/article/details/123145104</link><guid>https://blog.youkuaiyun.com/fair_angle/article/details/123145104</guid><author>fair_angle</author><pubDate>Sat, 26 Feb 2022 09:11:02 +0800</pubDate><description><![CDATA[RK3399 numpy安装]]></description><category></category></item><item><title><![CDATA[C\C++中的链接类问题整理]]></title><link>https://blog.youkuaiyun.com/fair_angle/article/details/90343265</link><guid>https://blog.youkuaiyun.com/fair_angle/article/details/90343265</guid><author>fair_angle</author><pubDate>Sun, 19 May 2019 16:59:32 +0800</pubDate><description><![CDATA[在C\C++的代码的初学阶段，常常会出现"XXX重定义"、”，或“XXX未定义”等问题，尤其是在初次接触比较复杂的代码的时候，各种文件关系复杂，在编译时猛然蹦出这么一个问题，乍一看让人有点摸不着头脑。为了详细介绍这个问题，下面将引用一个简单的来展示这种bug的出现，并给出相应的解决办法。

以C++为例，假设有两个功能A.cpp\B.cpp，以下为A.cpp对于的.h文件（只做演示）


clas...]]></description><category></category></item><item><title><![CDATA[Leetcode笔记整理—easy篇—66.Plus one]]></title><link>https://blog.youkuaiyun.com/fair_angle/article/details/85676145</link><guid>https://blog.youkuaiyun.com/fair_angle/article/details/85676145</guid><author>fair_angle</author><pubDate>Thu, 03 Jan 2019 09:46:51 +0800</pubDate><description><![CDATA[问题描述:
Given a non-empty array of digits representing a non-negative integer, plus one to the integer.
The digits are stored such that the most significant digit is at the head of the list, and each el...]]></description><category></category></item><item><title><![CDATA[Leetcode笔记整理—easy篇—Length of Last Word]]></title><link>https://blog.youkuaiyun.com/fair_angle/article/details/85541442</link><guid>https://blog.youkuaiyun.com/fair_angle/article/details/85541442</guid><author>fair_angle</author><pubDate>Tue, 01 Jan 2019 16:00:15 +0800</pubDate><description><![CDATA[Length of Last Word

题目描述：

Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.

If the last word does not exist, retu...]]></description><category></category></item><item><title><![CDATA[Leetcode笔记整理—easy篇—Remove Duplicates from Sorted Array]]></title><link>https://blog.youkuaiyun.com/fair_angle/article/details/72477583</link><guid>https://blog.youkuaiyun.com/fair_angle/article/details/72477583</guid><author>fair_angle</author><pubDate>Thu, 18 May 2017 17:29:27 +0800</pubDate><description><![CDATA[Remove Duplicates from Sorted ArrayHR，题目描述： 
 Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for anot]]></description><category></category></item><item><title><![CDATA[Leetcode笔记整理—easy篇—Valid Parentheses]]></title><link>https://blog.youkuaiyun.com/fair_angle/article/details/70792570</link><guid>https://blog.youkuaiyun.com/fair_angle/article/details/70792570</guid><author>fair_angle</author><pubDate>Wed, 26 Apr 2017 11:51:02 +0800</pubDate><description><![CDATA[**Valid Parentheses**问题简介：Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.The brackets must close in the correct order, “()” and “(]]></description><category></category></item><item><title><![CDATA[Leetcode算法练习-easy篇-Roman to Integer]]></title><link>https://blog.youkuaiyun.com/fair_angle/article/details/70768234</link><guid>https://blog.youkuaiyun.com/fair_angle/article/details/70768234</guid><author>fair_angle</author><pubDate>Tue, 25 Apr 2017 22:48:26 +0800</pubDate><description><![CDATA[题目简述：

Given a roman numeral, convert it to an integer.

Input is guaranteed to be within the range from 1 to 3999.

上图：



本题解法：



int retValue(char a)
{
    if(a == 'M')
        return 1000;
    if]]></description><category></category></item><item><title><![CDATA[Leetcode算法练习-easy篇-Reverse Integer]]></title><link>https://blog.youkuaiyun.com/fair_angle/article/details/70577749</link><guid>https://blog.youkuaiyun.com/fair_angle/article/details/70577749</guid><author>fair_angle</author><pubDate>Mon, 24 Apr 2017 11:32:19 +0800</pubDate><description><![CDATA[Letcode算法练习easy篇-Reverse Integer]]></description><category></category></item></channel></rss>