<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Miss_He的博客]]></title><description><![CDATA[nothing to say]]></description><link>https://blog.youkuaiyun.com/Miss_Bingo_He</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Miss_Bingo_He]]></copyright><item><title><![CDATA[IDEA提交项目代码到码云失败后的回滚重提交操作]]></title><link>https://blog.youkuaiyun.com/Miss_Bingo_He/article/details/115330177</link><guid>https://blog.youkuaiyun.com/Miss_Bingo_He/article/details/115330177</guid><author>Miss_Bingo_He</author><pubDate>Tue, 30 Mar 2021 16:56:59 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[机试2.5—二分查找]]></title><link>https://blog.youkuaiyun.com/Miss_Bingo_He/article/details/104595162</link><guid>https://blog.youkuaiyun.com/Miss_Bingo_He/article/details/104595162</guid><author>Miss_Bingo_He</author><pubDate>Sun, 01 Mar 2020 16:48:53 +0800</pubDate><description><![CDATA[题目1：查找

题目2：打印极值点下标

没有用到二分。。
]]></description><category></category></item><item><title><![CDATA[机试2.1—排序]]></title><link>https://blog.youkuaiyun.com/Miss_Bingo_He/article/details/104577876</link><guid>https://blog.youkuaiyun.com/Miss_Bingo_He/article/details/104577876</guid><author>Miss_Bingo_He</author><pubDate>Sat, 29 Feb 2020 17:24:22 +0800</pubDate><description><![CDATA[划重点：

1.头文件 #include&lt;algorithm&gt;

2.定义排序规则函数bool cmp(形参){。。。}

3.调用排序函数sort(buf,buf+n,cmp)



题目：成绩排序

输入任意（用户，成绩）序列，可以获得成绩从高到低或从低到高的排列,相同成绩
都按先录入排列在前的规则处理。

示例：
jack70
peter96
Tom...]]></description><category></category></item><item><title><![CDATA[机试2.3—Hash应用]]></title><link>https://blog.youkuaiyun.com/Miss_Bingo_He/article/details/104577008</link><guid>https://blog.youkuaiyun.com/Miss_Bingo_He/article/details/104577008</guid><author>Miss_Bingo_He</author><pubDate>Sat, 29 Feb 2020 17:00:27 +0800</pubDate><description><![CDATA[Hash题型判断：

1.输入数据范围m有限

2.要求的输出为m种情况的重复次数



题目1：剩下的树

有一个长度为整数L(1&lt;=L&lt;=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。  现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从10...]]></description><category></category></item><item><title><![CDATA[初识GIT]]></title><link>https://blog.youkuaiyun.com/Miss_Bingo_He/article/details/80778099</link><guid>https://blog.youkuaiyun.com/Miss_Bingo_He/article/details/80778099</guid><author>Miss_Bingo_He</author><pubDate>Fri, 22 Jun 2018 21:50:59 +0800</pubDate><description><![CDATA[文头说明：这是一篇不全面不严谨的笔记，不具科普性。                若是以学习git为目的，请移步下列学习资源。//学习资源：        廖雪峰Git教程：https://www.liaoxuefeng.com/wiki/0013739516305929606dd18361248578c67b8067c8c017b000        Git实用教程（小甲鱼）：https://w...]]></description><category></category></item></channel></rss>