<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[rock4you]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/rock4you</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; rock4you]]></copyright><item><title><![CDATA[阿里巴巴社区电商技术部-2021算法实习生招聘]]></title><link>https://blog.youkuaiyun.com/rock4you/article/details/114576264</link><guid>https://blog.youkuaiyun.com/rock4you/article/details/114576264</guid><author>rock4you</author><pubDate>Tue, 09 Mar 2021 10:00:53 +0800</pubDate><description><![CDATA[扫码直达



详细介绍




]]></description><category></category></item><item><title><![CDATA[DIoU CIoU]]></title><link>https://blog.youkuaiyun.com/rock4you/article/details/107316635</link><guid>https://blog.youkuaiyun.com/rock4you/article/details/107316635</guid><author>rock4you</author><pubDate>Mon, 13 Jul 2020 14:39:03 +0800</pubDate><description><![CDATA[DIoU (Distance-IoU) CIoU (Complete IoU) Loss


论文https://arxiv.org/abs/1911.08287

论文配套代码https://github.com/Zzh-tju/DIoU-darknet

Paddle版代码https://github.com/PaddlePaddle/PaddleDetection/blob/master/ppdet/modeling/losses/iou_loss.py
...]]></description><category></category></item><item><title><![CDATA[使用PaddleDetection训练自己的数据集]]></title><link>https://blog.youkuaiyun.com/rock4you/article/details/107113290</link><guid>https://blog.youkuaiyun.com/rock4you/article/details/107113290</guid><author>rock4you</author><pubDate>Fri, 03 Jul 2020 19:35:09 +0800</pubDate><description><![CDATA[使用PaddleDetection训练自己的数据集

https://aistudio.baidu.com/aistudio/projectdetail/441868?shared=1


]]></description><category></category></item><item><title><![CDATA[爬虫-获取指定城市所有企业信息]]></title><link>https://blog.youkuaiyun.com/rock4you/article/details/106349484</link><guid>https://blog.youkuaiyun.com/rock4you/article/details/106349484</guid><author>rock4you</author><pubDate>Tue, 26 May 2020 10:27:54 +0800</pubDate><description><![CDATA[爬虫获取指定城市的所有企业信息]]></description><category></category></item><item><title><![CDATA[零基础实战行人重识别ReID项目-基于Milvus的以图搜图]]></title><link>https://blog.youkuaiyun.com/rock4you/article/details/106107702</link><guid>https://blog.youkuaiyun.com/rock4you/article/details/106107702</guid><author>rock4you</author><pubDate>Wed, 13 May 2020 22:44:56 +0800</pubDate><description><![CDATA[零基础复现ReID算法，并结合Milvus开源工具进行工程化落地。
]]></description><category></category></item><item><title><![CDATA[AAAI 2020 收录的 百度 腾讯优图 蚂蚁金服的论文]]></title><link>https://blog.youkuaiyun.com/rock4you/article/details/106033117</link><guid>https://blog.youkuaiyun.com/rock4you/article/details/106033117</guid><author>rock4you</author><pubDate>Sun, 10 May 2020 12:48:30 +0800</pubDate><description><![CDATA[关注公众号，回复“百度28”打包下载。]]></description><category></category></item><item><title><![CDATA[YOLO V4论文翻译及复现]]></title><link>https://blog.youkuaiyun.com/rock4you/article/details/106012295</link><guid>https://blog.youkuaiyun.com/rock4you/article/details/106012295</guid><author>rock4you</author><pubDate>Sat, 09 May 2020 09:45:37 +0800</pubDate><description><![CDATA[论文标题：YOLOv4: Optimal Speed and Accuracy of Object Detection

下载地址：https://arxiv.org/abs/2004.10934



标题：YOLOv4：优化目标检测的速度和精度



摘要：

有大量的特征被认为可以提升卷积神经网络的精度。

将这些特征进行组合后在大规模数据集上进行实际的测试，并给出理论层面的正当理由，是必要的。

有些特征针对特定问题、特定模型，或者仅仅是针对小规模数据集起作用。

与此同时，有些特征，例如批标准..]]></description><category></category></item><item><title><![CDATA[百度深度学习7日打卡第六期：Python小白逆袭大神 Day3-《青春有你2》选手数据分析]]></title><link>https://blog.youkuaiyun.com/rock4you/article/details/105783848</link><guid>https://blog.youkuaiyun.com/rock4you/article/details/105783848</guid><author>rock4you</author><pubDate>Mon, 27 Apr 2020 09:52:57 +0800</pubDate><description><![CDATA[百度深度学习7日打卡第六期：Python小白逆袭大神

https://aistudio.baidu.com/aistudio/course/introduce/1224



Day3-《青春有你2》选手数据分析





这题主要考察Pandas的Series的访问，以及Matplotlib中的饼图的绘制方法，

分别参考官方课件第21页和43页：







需要做的工作：

1.指...]]></description><category></category></item><item><title><![CDATA[百度深度学习7日打卡第六期：Python小白逆袭大神 Day2-《青春有你2》选手信息爬取]]></title><link>https://blog.youkuaiyun.com/rock4you/article/details/105783135</link><guid>https://blog.youkuaiyun.com/rock4you/article/details/105783135</guid><author>rock4you</author><pubDate>Mon, 27 Apr 2020 09:43:54 +0800</pubDate><description><![CDATA[百度深度学习7日打卡第六期：Python小白逆袭大神

https://aistudio.baidu.com/aistudio/course/introduce/1224



Day2-《青春有你2》选手信息爬取







这个作业主要考察BeautifulSoup以及Chrome开发者模式的使用。



使用Chrome打开网站：https://baike.baidu.com/ite...]]></description><category></category></item><item><title><![CDATA[百度深度学习7日打卡第六期：Python小白逆袭大神 Day1-Python基础练习]]></title><link>https://blog.youkuaiyun.com/rock4you/article/details/105778592</link><guid>https://blog.youkuaiyun.com/rock4you/article/details/105778592</guid><author>rock4you</author><pubDate>Sun, 26 Apr 2020 22:13:50 +0800</pubDate><description><![CDATA[百度深度学习7日打卡第六期：Python小白逆袭大神

https://aistudio.baidu.com/aistudio/course/introduce/1224



Day1-Python基础练习



作业一：输出 9*9 乘法口诀表(注意格式)


def table():
    #在这里写下您的乘法口诀表代码吧！
    for i in range(1,10,1):
   ...]]></description><category></category></item><item><title><![CDATA[leetcode 1143. 最长公共子序列]]></title><link>https://blog.youkuaiyun.com/rock4you/article/details/105455531</link><guid>https://blog.youkuaiyun.com/rock4you/article/details/105455531</guid><author>rock4you</author><pubDate>Sun, 12 Apr 2020 13:04:35 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/longest-common-subsequence/



解题思路：

动态规划，二维数组，记录最长公共子序列的值。


class Solution {
public:
    int longestCommonSubsequence(string text1, string text2) {
        int l1 = te...]]></description><category></category></item><item><title><![CDATA[leetcode 56 Merge Intervals  leetcode 57 Insert Interval 区间合并]]></title><link>https://blog.youkuaiyun.com/rock4you/article/details/105388772</link><guid>https://blog.youkuaiyun.com/rock4you/article/details/105388772</guid><author>rock4you</author><pubDate>Wed, 08 Apr 2020 15:26:51 +0800</pubDate><description><![CDATA[leetcode 56Merge Intervals

https://leetcode.com/problems/merge-intervals/




class Solution {
public:
    vector&lt;vector&lt;int&gt;&gt; merge(vector&lt;vector&lt;int&gt;&gt;&amp; intervals) {
   ...]]></description><category></category></item><item><title><![CDATA[leetcode 206. Reverse Linked List 链表反转  递归、非递归]]></title><link>https://blog.youkuaiyun.com/rock4you/article/details/105271114</link><guid>https://blog.youkuaiyun.com/rock4you/article/details/105271114</guid><author>rock4you</author><pubDate>Thu, 02 Apr 2020 17:16:11 +0800</pubDate><description><![CDATA[剑指offer第24题

https://leetcode.com/problems/reverse-linked-list/



1.非递归


class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        if(head==nullptr || head-&gt;next ==nullptr) ret...]]></description><category></category></item><item><title><![CDATA[HDOJ 1231 最大和连续子序列 （LeetCode 53、剑指Offer42的拓展)]]></title><link>https://blog.youkuaiyun.com/rock4you/article/details/105211830</link><guid>https://blog.youkuaiyun.com/rock4you/article/details/105211830</guid><author>rock4you</author><pubDate>Mon, 30 Mar 2020 23:25:27 +0800</pubDate><description><![CDATA[LeetCode 53、剑指Offer42 都是求 连续子序列的最大和，

来自杭电OJ 1231这道题，不仅求最大和，还要给出子序列首位元素。

http://acm.hdu.edu.cn/showproblem.php?pid=1231







代码：


#include&lt;stdio.h&gt;
#include&lt;vector&gt;

using namespa...]]></description><category></category></item><item><title><![CDATA[leetcode 557. Reverse Words in a String III 反转字符串中的每个单词]]></title><link>https://blog.youkuaiyun.com/rock4you/article/details/104296139</link><guid>https://blog.youkuaiyun.com/rock4you/article/details/104296139</guid><author>rock4you</author><pubDate>Sun, 16 Feb 2020 11:57:34 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/reverse-words-in-a-string-iii/



解法一：遇到字符就压栈，遇到空格或最后一个字符就弹出栈。


class Solution {
public:
    string reverseWords(string s) {
        int n = s.length();
        if(n&lt;...]]></description><category></category></item><item><title><![CDATA[leetcode 151 / 186. Reverse Words in a String 将字符串中的单词反序]]></title><link>https://blog.youkuaiyun.com/rock4you/article/details/104308804</link><guid>https://blog.youkuaiyun.com/rock4you/article/details/104308804</guid><author>rock4you</author><pubDate>Sun, 16 Feb 2020 11:28:07 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/reverse-words-in-a-string/





先整体反序，再逐个单词块进行反序。

参考https://www.cnblogs.com/grandyang/p/4606676.html


class Solution {
public:
    string reverseWords(string s) {
   ...]]></description><category></category></item><item><title><![CDATA[leetcode 215. Kth Largest Element in an Array 数组中的第K大的元素]]></title><link>https://blog.youkuaiyun.com/rock4you/article/details/104307597</link><guid>https://blog.youkuaiyun.com/rock4you/article/details/104307597</guid><author>rock4you</author><pubDate>Fri, 14 Feb 2020 10:29:28 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/kth-largest-element-in-an-array/



将数组看为没有调整到位的最大堆，由于堆是完全二叉树，因此根节点与子节点的下标存在对应关系。

每次从堆中取出最大值，将其放至根节点，再与最后一个节点互换位置，然后将其从堆删除。


class Solution {
public:
    int findKthLar...]]></description><category></category></item><item><title><![CDATA[4邻域、8邻域问题-DFS/BFS]]></title><link>https://blog.youkuaiyun.com/rock4you/article/details/104280166</link><guid>https://blog.youkuaiyun.com/rock4you/article/details/104280166</guid><author>rock4you</author><pubDate>Wed, 12 Feb 2020 15:56:30 +0800</pubDate><description><![CDATA[leetcode 200 岛屿个数

leetcode 695 最大岛屿面积

leetcode 1091 八邻域，矩阵左上角至右下角最短路径
]]></description><category></category></item><item><title><![CDATA[leetcode 123. Best Time to Buy and Sell Stock III 股票最多两次买入、两次卖出的最大利润]]></title><link>https://blog.youkuaiyun.com/rock4you/article/details/104275018</link><guid>https://blog.youkuaiyun.com/rock4you/article/details/104275018</guid><author>rock4you</author><pubDate>Wed, 12 Feb 2020 11:04:46 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/



数组的最大2子段和，允许在一天内买入又卖出，相当于不交易。因为题目规定的是最多交易两次，而不是必须交易两次。


class Solution {
public:
    int maxProfit(vector&lt;int&gt;&amp; prices)...]]></description><category></category></item><item><title><![CDATA[leetcode 122. Best Time to Buy and Sell Stock II 股票多次买入卖出的最大利润]]></title><link>https://blog.youkuaiyun.com/rock4you/article/details/104274378</link><guid>https://blog.youkuaiyun.com/rock4you/article/details/104274378</guid><author>rock4you</author><pubDate>Wed, 12 Feb 2020 10:31:35 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/



把所有的大于零的价格差累加起来。


class Solution {
public:
    int maxProfit(vector&lt;int&gt;&amp; prices) {
        int n = prices.size();
     ...]]></description><category></category></item></channel></rss>