<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[GPF的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/GPFYCF521</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; GPFYCF521]]></copyright><item><title><![CDATA[STL-算法]]></title><link>https://blog.youkuaiyun.com/GPFYCF521/article/details/88598302</link><guid>https://blog.youkuaiyun.com/GPFYCF521/article/details/88598302</guid><author>GPFYCF521</author><pubDate>Sat, 16 Mar 2019 15:00:12 +0800</pubDate><description><![CDATA[6.算法
（1）算法介绍
（1）什么是算法
	所谓算法就是数据的具体处理方式，在程序中算法的常见组织形式就是
	函数，单个的子函数就是一个小型的算法单元。


（2）c++中涉及的算法有两类
 	（1）c++函数库提供的算法函数（现成可用的算法）

		（1）成员算法函数
			所有的容器的都有自己的成员算法函数，比如vector/list/map都提供了
			swap算法函数。

			除此...]]></description><category></category></item><item><title><![CDATA[STL-关联容器]]></title><link>https://blog.youkuaiyun.com/GPFYCF521/article/details/88598232</link><guid>https://blog.youkuaiyun.com/GPFYCF521/article/details/88598232</guid><author>GPFYCF521</author><pubDate>Sat, 16 Mar 2019 14:56:50 +0800</pubDate><description><![CDATA[5. 关联容器
（1）关联容器的特点
（1）容器需要存放对象和key值，key值与对象之间是一种映射关系。

（2）每个对象被存入到关联容器中时，会对key进行排序，进过比较后找到合适的
	位置后存放。因此key的数据类型需要提供排序方法，可以通过提供orerator&amp;amp;lt;()
	或者Compare这两个函数进行比较。


（3）map只支持双向迭代器，因此不支持随机访问，虽然map支持[key...]]></description><category></category></item><item><title><![CDATA[STL-list详解]]></title><link>https://blog.youkuaiyun.com/GPFYCF521/article/details/88598175</link><guid>https://blog.youkuaiyun.com/GPFYCF521/article/details/88598175</guid><author>GPFYCF521</author><pubDate>Sat, 16 Mar 2019 14:54:17 +0800</pubDate><description><![CDATA[4.list容器
（1）list的特点
前面讲的vector是非常常用的容器，使用频繁都非常高。

vector的优势：
	vectoer的优点直接导致了它的缺点，因为vector本身就是数组，数组
	是顺序（连续）存储的，因此可以很好的支持随机访问，支持随机访
	问是顺序存储的优势。


vector的缺点：
	在序列中频繁插入和删除的效率非常的低，因为会涉及大片内存数据被
	移动，这也是顺序存...]]></description><category></category></item><item><title><![CDATA[STL模版-vector详解]]></title><link>https://blog.youkuaiyun.com/GPFYCF521/article/details/88598152</link><guid>https://blog.youkuaiyun.com/GPFYCF521/article/details/88598152</guid><author>GPFYCF521</author><pubDate>Sat, 16 Mar 2019 14:53:25 +0800</pubDate><description><![CDATA[3. vector容器

	（1）普通数组与vector

	只要能够使用数组的地方，就一定可以使用vector代替，前面说到，vector其实就是
	数组，只是空间开辟于堆中。普通数组长度是固定的，但是vector容器的容量和大小
	可以根据实际情况不同而改变。

	容量与大小：
	对于vector来说容量和大小是不同的，容量&amp;gt;=大小，
	容量：vector容器最大能够存放的元素个数。
	...]]></description><category></category></item><item><title><![CDATA[git使用手册]]></title><link>https://blog.youkuaiyun.com/GPFYCF521/article/details/83998375</link><guid>https://blog.youkuaiyun.com/GPFYCF521/article/details/83998375</guid><author>GPFYCF521</author><pubDate>Mon, 12 Nov 2018 20:47:26 +0800</pubDate><description><![CDATA[#1、创建仓库
本地目录创建仓库：git init
远程仓库克隆：git clone
#2、常见操作
查看文件状态：git status
跟踪新文件：git add &amp;amp;lt;new file&amp;amp;gt;
忽略某些文件： 在仓库中加入 .gitignore文件，并把需要忽略的文件名或者目录名记录在.gitignore文件
查看文件前后变化：git diff &amp;amp;lt;file&amp;amp;gt;
提交更新：git c...]]></description><category></category></item><item><title><![CDATA[Ubuntu 16.04 x64搭建GitLab服务器操作笔记]]></title><link>https://blog.youkuaiyun.com/GPFYCF521/article/details/83796283</link><guid>https://blog.youkuaiyun.com/GPFYCF521/article/details/83796283</guid><author>GPFYCF521</author><pubDate>Tue, 06 Nov 2018 23:31:04 +0800</pubDate><description><![CDATA[本文主要记录在Ubuntu 16.04操作系统中搭建GitLab服务器的操作记录，以下是操作步骤（主要参考资料：https://about.gitlab.com/downloads/#ubuntu1604）。
1.安装依赖包，运行命令
sudo apt-get install curl openssh-server ca-certificates postfix 

执行完成后，出现邮件配置，选择...]]></description><category></category></item><item><title><![CDATA[docker file :  Multiview]]></title><link>https://blog.youkuaiyun.com/GPFYCF521/article/details/81606945</link><guid>https://blog.youkuaiyun.com/GPFYCF521/article/details/81606945</guid><author>GPFYCF521</author><pubDate>Sun, 12 Aug 2018 15:36:47 +0800</pubDate><description><![CDATA[dockerfile 标准样例

FROM ubuntu:16.04
RUN apt-get update

# INSTALL FFMPEG &amp;amp; OTHERS
RUN apt-get install -y unzip cmake g++ make ffmpeg libx264-dev wget
RUN apt-get install -y libavcodec-dev libavform...]]></description><category></category></item><item><title><![CDATA[jupyter notebook instrall 多个python kernal]]></title><link>https://blog.youkuaiyun.com/GPFYCF521/article/details/81410598</link><guid>https://blog.youkuaiyun.com/GPFYCF521/article/details/81410598</guid><author>GPFYCF521</author><pubDate>Sat, 04 Aug 2018 14:19:20 +0800</pubDate><description><![CDATA[1、安装



conda install ipykernel

2、首先激活对应的conda环境



source activate 环境名称

3、将环境写入notebook的kernel中

python -m ipykernel install --user --name 环境名称 --display-name &quot;Python (环境名称)&quot;


注意： 
配置文件会写在这个路径下 
I...]]></description><category></category></item><item><title><![CDATA[18   4Sum]]></title><link>https://blog.youkuaiyun.com/GPFYCF521/article/details/79731302</link><guid>https://blog.youkuaiyun.com/GPFYCF521/article/details/79731302</guid><author>GPFYCF521</author><pubDate>Sun, 24 Jun 2018 16:55:41 +0800</pubDate><description><![CDATA[

题目
Code
MyCode
问题





题目

Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of ta...]]></description><category></category></item><item><title><![CDATA[题号：16 题目： 3Sum Closest]]></title><link>https://blog.youkuaiyun.com/GPFYCF521/article/details/79729962</link><guid>https://blog.youkuaiyun.com/GPFYCF521/article/details/79729962</guid><author>GPFYCF521</author><pubDate>Sun, 24 Jun 2018 16:55:32 +0800</pubDate><description><![CDATA[

问题
想法
Code
问题







问题

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that ea...]]></description><category></category></item><item><title><![CDATA[565  Array Nesting]]></title><link>https://blog.youkuaiyun.com/GPFYCF521/article/details/79751182</link><guid>https://blog.youkuaiyun.com/GPFYCF521/article/details/79751182</guid><author>GPFYCF521</author><pubDate>Sun, 24 Jun 2018 16:55:25 +0800</pubDate><description><![CDATA[

题目
想法
MyCode
Time Limit Exceeded Solution
Accept Solution


Other Classic Solution
solution one
Best solution









题目

A zero-indexed array A of length N contains all integers from 0 to N-1. Fin...]]></description><category></category></item><item><title><![CDATA[561  Array Partition I]]></title><link>https://blog.youkuaiyun.com/GPFYCF521/article/details/79757871</link><guid>https://blog.youkuaiyun.com/GPFYCF521/article/details/79757871</guid><author>GPFYCF521</author><pubDate>Sun, 24 Jun 2018 16:55:17 +0800</pubDate><description><![CDATA[题目

Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), …, (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large as po...]]></description><category></category></item><item><title><![CDATA[53]]></title><link>https://blog.youkuaiyun.com/GPFYCF521/article/details/79890056</link><guid>https://blog.youkuaiyun.com/GPFYCF521/article/details/79890056</guid><author>GPFYCF521</author><pubDate>Sun, 24 Jun 2018 16:55:01 +0800</pubDate><description><![CDATA[include

include

include



include 



include

using namespace std;

class Solution { 
public: 
    int maxSubArray(vector&amp;amp;amp;amp; nums) { 
        vector tp = nums; 
        int large_sum ; 
        ...]]></description><category></category></item><item><title><![CDATA[题号：15  题目名：3Sum]]></title><link>https://blog.youkuaiyun.com/GPFYCF521/article/details/79717306</link><guid>https://blog.youkuaiyun.com/GPFYCF521/article/details/79717306</guid><author>GPFYCF521</author><pubDate>Sun, 24 Jun 2018 16:54:50 +0800</pubDate><description><![CDATA[

题目
想法
Code
问题







题目

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: The soluti...]]></description><category></category></item><item><title><![CDATA[翻转链表]]></title><link>https://blog.youkuaiyun.com/GPFYCF521/article/details/80681274</link><guid>https://blog.youkuaiyun.com/GPFYCF521/article/details/80681274</guid><author>GPFYCF521</author><pubDate>Sun, 24 Jun 2018 16:54:40 +0800</pubDate><description><![CDATA[//思路为将节点从前到后依次放到表头，最后最后的节点到了最前面,最前面的节点到了最后面
ListNode * ReverseList(ListNode *  head)
{
   //如果链表为空或者链表中只有一个元素
   if(head==NULL || head-&amp;amp;amp;gt;m_pNext==NULL)
       return head;
   ListNode * p=head-&amp;amp;amp;gt;m...]]></description><category></category></item><item><title><![CDATA[27. Remove Element]]></title><link>https://blog.youkuaiyun.com/GPFYCF521/article/details/80792133</link><guid>https://blog.youkuaiyun.com/GPFYCF521/article/details/80792133</guid><author>GPFYCF521</author><pubDate>Sun, 24 Jun 2018 16:54:27 +0800</pubDate><description><![CDATA[

题目
想法
Code





题目

Given an array nums and a value val, remove all instances of that value in-place and return the new length. 
Do not allocate extra space for another array, you must do this by mo...]]></description><category></category></item><item><title><![CDATA[26. Remove Duplicates from Sorted Array]]></title><link>https://blog.youkuaiyun.com/GPFYCF521/article/details/80792419</link><guid>https://blog.youkuaiyun.com/GPFYCF521/article/details/80792419</guid><author>GPFYCF521</author><pubDate>Sun, 24 Jun 2018 16:54:04 +0800</pubDate><description><![CDATA[

题目
想法
Code







题目

Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length. 
Do not allocate extra space for another array, you...]]></description><category></category></item><item><title><![CDATA[经典网络结构简介]]></title><link>https://blog.youkuaiyun.com/GPFYCF521/article/details/80739269</link><guid>https://blog.youkuaiyun.com/GPFYCF521/article/details/80739269</guid><author>GPFYCF521</author><pubDate>Tue, 19 Jun 2018 21:20:10 +0800</pubDate><description><![CDATA[该博客详细介绍了目前常见的网络的结构 
https://juejin.im/post/5ae283c4f265da0b886d2323#comment]]></description><category></category></item><item><title><![CDATA[tensorflow滑动平均模型]]></title><link>https://blog.youkuaiyun.com/GPFYCF521/article/details/80616879</link><guid>https://blog.youkuaiyun.com/GPFYCF521/article/details/80616879</guid><author>GPFYCF521</author><pubDate>Thu, 07 Jun 2018 23:49:17 +0800</pubDate><description><![CDATA[1、使用滑动平均模型训练时，如果使用下列语句创建saver，滑动平均值的隐子变量的值，就会赋值给相应的同名变量。 
一般使用滑动平均模型，测试阶段如下加载。 
原始变量的值丢失，使用滑动平均值赋值

variable_averages = tf.train.ExponentialMovingAverage(t_config.moving_average_decay)
variables_to_re...]]></description><category></category></item><item><title><![CDATA[Jupyter Notebook服务器模式配置]]></title><link>https://blog.youkuaiyun.com/GPFYCF521/article/details/80524752</link><guid>https://blog.youkuaiyun.com/GPFYCF521/article/details/80524752</guid><author>GPFYCF521</author><pubDate>Thu, 31 May 2018 15:15:40 +0800</pubDate><description><![CDATA[1、生成配置文件



jupyter notebook --generate-config

2、生成秘钥 
在终端输入 ipython，创建一个秘钥

In [1]: from notebook.auth import passwd
In [2]: passwd()
Enter password: 
Verify password: 
Out[2]: 'sha1:ce23d945972f:34...]]></description><category></category></item></channel></rss>