<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Robin的思路汇聚屋]]></title><description><![CDATA[小白的天堂，二哈的娱乐场所]]></description><link>https://blog.youkuaiyun.com/Robin_Ge</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Robin_Ge]]></copyright><item><title><![CDATA[IDEA如何取消代码提示补全功能]]></title><link>https://blog.youkuaiyun.com/Robin_Ge/article/details/146286294</link><guid>https://blog.youkuaiyun.com/Robin_Ge/article/details/146286294</guid><author>Robin_Ge</author><pubDate>Sat, 15 Mar 2025 22:01:13 +0800</pubDate><description><![CDATA[https://blog.youkuaiyun.com/weixin_52996939/article/details/144053018]]></description><category></category></item><item><title><![CDATA[C++]]></title><link>https://blog.youkuaiyun.com/Robin_Ge/article/details/103722749</link><guid>https://blog.youkuaiyun.com/Robin_Ge/article/details/103722749</guid><author>Robin_Ge</author><pubDate>Thu, 26 Dec 2019 21:13:55 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;vector&gt;
using namespace std;
int main() {
	int nums[] = { 0,1,2,3,4,5,6,7,8,9 };
	vector&lt;int&gt; vec(nums, nums + sizeof(nums) / sizeof(nums[0]));
	auto it...]]></description><category></category></item><item><title><![CDATA[linux下所有软件的安装]]></title><link>https://blog.youkuaiyun.com/Robin_Ge/article/details/103576024</link><guid>https://blog.youkuaiyun.com/Robin_Ge/article/details/103576024</guid><author>Robin_Ge</author><pubDate>Tue, 17 Dec 2019 10:55:55 +0800</pubDate><description><![CDATA[1. docker+redis
#更新源
sudo apt-get update
#安装docker
sudo apt-get install docker.io
#查看安装了哪些镜像，如果安装成功，里面应该能看到镜像
sudo docker images
#在docker中安装redis
sudo docker pull redis
#查看是否安装成功
sudo docker images
#r...]]></description><category></category></item><item><title><![CDATA[15 三数之和]]></title><link>https://blog.youkuaiyun.com/Robin_Ge/article/details/102985195</link><guid>https://blog.youkuaiyun.com/Robin_Ge/article/details/102985195</guid><author>Robin_Ge</author><pubDate>Sat, 09 Nov 2019 12:45:40 +0800</pubDate><description><![CDATA[思路
找出三个数之和，三层for循环肯定会超时，所以可以将每个数的频次记录在map中(pair为(数，频次))，这样map就记录了所有的数以及他们出现的频次。
#include &lt;iostream&gt;
#include &lt;vector&gt;
#include &lt;map&gt;
#include &lt;algorithm&gt;
using namespace std;

...]]></description><category></category></item><item><title><![CDATA[leetcode - 1 两数之和]]></title><link>https://blog.youkuaiyun.com/Robin_Ge/article/details/102981499</link><guid>https://blog.youkuaiyun.com/Robin_Ge/article/details/102981499</guid><author>Robin_Ge</author><pubDate>Fri, 08 Nov 2019 23:19:58 +0800</pubDate><description><![CDATA[思路
由于是求数组中两数之和为S，所以正常情况下可以对这个数组进行排序，然后使用双索引，数组第一个元素和最后一个元素求和，当和为S时皆大欢喜，如果和大于S的话则表明和太小了，于是前面的索引向后移动，如果和小于S的话则表明和太大了，于是后面的索引向前移动，最终当两个索引相同时结束(因为同一个数只能选择一次，所以当索引相同时循环结束)
难点

因为这里是返回原数组中的索引，而如果对数组进行排序后则索引...]]></description><category></category></item><item><title><![CDATA[1.时间复杂度与空间复杂度概要]]></title><link>https://blog.youkuaiyun.com/Robin_Ge/article/details/102892450</link><guid>https://blog.youkuaiyun.com/Robin_Ge/article/details/102892450</guid><author>Robin_Ge</author><pubDate>Mon, 04 Nov 2019 10:51:13 +0800</pubDate><description><![CDATA[一、 算法时间复杂度

符号：O(f(n))
含义：某个算法需要执行的指令数的量级
定义：

学术界：算法执行上界
工业界：算法执行的最低上界


注意点：通常算法时间复杂度与算法所处环境有关，如插入排序最差情况为O(n^2)，最好情况为O(1)，但一般所说的插入排序的时间复杂度为O(n^2)是平均情况(绝大多数情况下的复杂度)，快速排序同理，最差为O(n^2)，最好情况为O(nlogn)，而平均...]]></description><category></category></item><item><title><![CDATA[函数指针和指针函数]]></title><link>https://blog.youkuaiyun.com/Robin_Ge/article/details/102892007</link><guid>https://blog.youkuaiyun.com/Robin_Ge/article/details/102892007</guid><author>Robin_Ge</author><pubDate>Mon, 04 Nov 2019 10:23:29 +0800</pubDate><description><![CDATA[转载自 https://blog.youkuaiyun.com/luoyayun361/article/details/80428882

                                                
                
                
                    
            
                版权声...]]></description><category></category></item><item><title><![CDATA[二叉搜索树]]></title><link>https://blog.youkuaiyun.com/Robin_Ge/article/details/102876886</link><guid>https://blog.youkuaiyun.com/Robin_Ge/article/details/102876886</guid><author>Robin_Ge</author><pubDate>Sat, 02 Nov 2019 21:37:26 +0800</pubDate><description><![CDATA[BinarySearchTree.h
#ifndef BinarySearchTree_H
#define BinarySearchTree_H

#include &lt;iostream&gt;

template&lt;class Type&gt; class BST; //前置声明
enum Boolean {FALSE, TRUE};


template&lt;class Type&g...]]></description><category></category></item><item><title><![CDATA[hashmap]]></title><link>https://blog.youkuaiyun.com/Robin_Ge/article/details/102876595</link><guid>https://blog.youkuaiyun.com/Robin_Ge/article/details/102876595</guid><author>Robin_Ge</author><pubDate>Sat, 02 Nov 2019 21:13:32 +0800</pubDate><description><![CDATA[哈希表就是通过给定的key直接计算一个位置，然后直接去这个位置去寻找对应的数，因为位置是通过计算一次性得到的，而去对应的位置去找(因为内部使用数组进行存储)，所以可以直接找到相应的位置，因此存储数据都是O(1)
HashMap.h
#ifndef HASHMAP_H
#define HASHMAP_H

#include &lt;vector&gt;

template&lt;class Key,...]]></description><category></category></item><item><title><![CDATA[大顶堆]]></title><link>https://blog.youkuaiyun.com/Robin_Ge/article/details/102876017</link><guid>https://blog.youkuaiyun.com/Robin_Ge/article/details/102876017</guid><author>Robin_Ge</author><pubDate>Sat, 02 Nov 2019 20:17:18 +0800</pubDate><description><![CDATA[MaxHeap.h
#ifndef _MAX_HEAP_
#define _MAX_HEAP_

template &lt;class T&gt;
class MaxHeap
{
public:
	MaxHeap(int mx = 10);
	virtual ~MaxHeap();

	bool IsEmpty();
	void Push(const T&amp;);
	void Pop();
	...]]></description><category></category></item><item><title><![CDATA[红黑树]]></title><link>https://blog.youkuaiyun.com/Robin_Ge/article/details/102875038</link><guid>https://blog.youkuaiyun.com/Robin_Ge/article/details/102875038</guid><author>Robin_Ge</author><pubDate>Sat, 02 Nov 2019 18:29:00 +0800</pubDate><description><![CDATA[Wrapper.h
#ifndef WRAPPER_H_
#define WRAPPER_H_

#include "Except.h"

template &lt;class Object&gt;
class Cref
{
public:
	Cref() : obj(NULL) {}
	//防止隐式转换
	//refer:https://baike.baidu.com/item/explicit...]]></description><category></category></item><item><title><![CDATA[vscode连接远程linux]]></title><link>https://blog.youkuaiyun.com/Robin_Ge/article/details/102831742</link><guid>https://blog.youkuaiyun.com/Robin_Ge/article/details/102831742</guid><author>Robin_Ge</author><pubDate>Thu, 31 Oct 2019 09:47:18 +0800</pubDate><description><![CDATA[1.首先远程和本地必须安装ssh，一般win10和ubuntu都会默认安装ssh
2.在本地cmd中使用 ssh [hostname] -l [username] -p [port] 试试能否连接上linux,如果能连接上就表明vscode可以连上
3.vscode安装 remote-ssh差将
4.在remote-ssh中设置远程账户

host写名字(用户vscode中展示 随意
hostna...]]></description><category></category></item><item><title><![CDATA[视频中的问题]]></title><link>https://blog.youkuaiyun.com/Robin_Ge/article/details/102537551</link><guid>https://blog.youkuaiyun.com/Robin_Ge/article/details/102537551</guid><author>Robin_Ge</author><pubDate>Sun, 13 Oct 2019 20:34:58 +0800</pubDate><description><![CDATA[p_thread_join回收子线程，void ** &amp;retval 完全理解不了

]]></description><category></category></item><item><title><![CDATA[人脸关键点检测总结]]></title><link>https://blog.youkuaiyun.com/Robin_Ge/article/details/101616912</link><guid>https://blog.youkuaiyun.com/Robin_Ge/article/details/101616912</guid><author>Robin_Ge</author><pubDate>Sat, 28 Sep 2019 15:06:43 +0800</pubDate><description><![CDATA[原链接：https://blog....]]></description><category></category></item><item><title><![CDATA[linux 问题指南]]></title><link>https://blog.youkuaiyun.com/Robin_Ge/article/details/101108653</link><guid>https://blog.youkuaiyun.com/Robin_Ge/article/details/101108653</guid><author>Robin_Ge</author><pubDate>Sat, 21 Sep 2019 15:34:49 +0800</pubDate><description><![CDATA[问题1. 安装Vmware_workstation的ubuntu后使用xshell连接，发现无法连接
解决方案：先将Vmware_workstation的ubuntu改为桥接模式后，在ubuntu中安装ssh后启动ssh服务即可使用xshell连接（因为Xshell默认使用ssh登录，而ubuntu默认是不安装ssh服务的）
sudo apt-get install openssh-server
...]]></description><category></category></item><item><title><![CDATA[使用python连接远程服务器的mysql]]></title><link>https://blog.youkuaiyun.com/Robin_Ge/article/details/100183137</link><guid>https://blog.youkuaiyun.com/Robin_Ge/article/details/100183137</guid><author>Robin_Ge</author><pubDate>Sun, 01 Sep 2019 15:14:09 +0800</pubDate><description><![CDATA[一.安装mysql
首先在服务器上安装mysql，因为我用的是ubuntu，所以使用
apt-get install mysql-server
出现设置root账号密码界面，设置密码即可
二.安装pymysql
在主机上python界面安装pymysql来进行远程连接
pip install pymysql
三.在mysql中创建表方便稍后查询
show databases
create data...]]></description><category></category></item><item><title><![CDATA[visual studio 创建 C/C++静态库和动态库]]></title><link>https://blog.youkuaiyun.com/Robin_Ge/article/details/99702153</link><guid>https://blog.youkuaiyun.com/Robin_Ge/article/details/99702153</guid><author>Robin_Ge</author><pubDate>Sun, 18 Aug 2019 15:01:25 +0800</pubDate><description><![CDATA[一、静态库
创建动态库
创建项目：文件 → 新建 → 项目 → visual c++ → win32程序（项目命名为staticlib） →  下一步→  静态库（其他默认即可） → 完成
创建一个容纳函数的cpp :点击项目staticlib → 右键 →  添加 → 新建项  → visual c++ → c++文件（文件命名为source.cpp）
在source.cpp文件中键入：
//其...]]></description><category></category></item><item><title><![CDATA[ESC ubuntu16.04 ipv6配置]]></title><link>https://blog.youkuaiyun.com/Robin_Ge/article/details/98317236</link><guid>https://blog.youkuaiyun.com/Robin_Ge/article/details/98317236</guid><author>Robin_Ge</author><pubDate>Sun, 04 Aug 2019 10:11:18 +0800</pubDate><description><![CDATA[1.申请一个ipv6地址
https://www.tunnelbroker.net/
创建通道
Create Regular Tunnel
1.1 创建一个账号

1.2 填写你 ECS 的公网 IP 地址以及选择隧道节点，点击 Create Tunnel 创建。


注：填写 IP 时出现 IP is a potential tunnel endpoint. 说明可以添加 ipv6 隧道。
1....]]></description><category></category></item><item><title><![CDATA[VSCode编写C++代码从零开始]]></title><link>https://blog.youkuaiyun.com/Robin_Ge/article/details/97034685</link><guid>https://blog.youkuaiyun.com/Robin_Ge/article/details/97034685</guid><author>Robin_Ge</author><pubDate>Tue, 23 Jul 2019 21:58:42 +0800</pubDate><description><![CDATA[1.下载vscode
先下载vscode，下载完成后安装c/c++插件
2.安装MinGW
2.1.下载MinGW
MinGW下载地址
2.2.安装MinGW
2.2.1

2.2.2

注：这里我修改了安装路径，默认即可，当然后面设置要注意。并且继续点击continue
2.2.3：对于箭头所指的每一项，右键Mark for installation，我这里选择了全部安装

2.2.4：点击in...]]></description><category></category></item><item><title><![CDATA[pytorch专题 --- load模型]]></title><link>https://blog.youkuaiyun.com/Robin_Ge/article/details/90612864</link><guid>https://blog.youkuaiyun.com/Robin_Ge/article/details/90612864</guid><author>Robin_Ge</author><pubDate>Mon, 27 May 2019 21:56:20 +0800</pubDate><description><![CDATA[版权声明：要转随便转，如果能加上原文的链接就感谢各位了。( ⊙ o ⊙ )          https://blog.youkuaiyun.com/Hungryof/article/details/81364487        &lt;/div&gt;
    ...]]></description><category></category></item></channel></rss>