<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[pku_Coder的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/pku_Coder</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; pku_Coder]]></copyright><item><title><![CDATA[[万能办法] Mac安装pkg包报错：安装失败 “安装器遇到了一个错误，导致安装失败，请联系软件制造商以获得帮助]]></title><link>https://blog.youkuaiyun.com/pku_Coder/article/details/129943263</link><guid>https://blog.youkuaiyun.com/pku_Coder/article/details/129943263</guid><author>pku_Coder</author><pubDate>Tue, 04 Apr 2023 01:20:01 +0800</pubDate><description><![CDATA[然后在【系统偏好设置】-【安全性与隐私】-【通用】-【允许从以下位置下载的应用】中选择「任何来源」，然后再安装。如果依然安装失败可以重启电脑后再试一次。原理是可能因为一些权限问题安装失败，但报错信息完全只字不提权限的事，这时候直接 sudo 安装暴力解决即可。换成你的安装包的名字即可。然后输入锁屏密码，把。]]></description><category></category></item><item><title><![CDATA[LeetCode Weekly Contest 127]]></title><link>https://blog.youkuaiyun.com/pku_Coder/article/details/88376409</link><guid>https://blog.youkuaiyun.com/pku_Coder/article/details/88376409</guid><author>pku_Coder</author><pubDate>Sun, 10 Mar 2019 11:34:31 +0800</pubDate><description><![CDATA[第一次参加 LeetCode 的每周编程赛，排在 178 / 4682	，还是可以接受的。（第一题交了次错答案罚时 5分钟真的伤不起啊不然都可以挺进前100了）
1、1005. Maximize Sum Of Array After K Negations
Given an array A of integers, we must modify the array in the following...]]></description><category></category></item><item><title><![CDATA[商汤科技2018校招研究员笔试第一场]]></title><link>https://blog.youkuaiyun.com/pku_Coder/article/details/88095719</link><guid>https://blog.youkuaiyun.com/pku_Coder/article/details/88095719</guid><author>pku_Coder</author><pubDate>Sun, 03 Mar 2019 22:50:51 +0800</pubDate><description><![CDATA[https://www.nowcoder.com/test/11960206/summary
题目1
铁柱在研究一个区域的小黄车使用分布。他得到了服务器上最近10000个用户的二维位置，现在他想把这些用户聚成K(K&amp;lt;10) 组，每组有一个中心C_i。他想评价聚类算法的好坏，把每个数据点到中心的l1距离作为总距离。即
D = sum_j || X_j - C( X_j ) ||_1
其中C(X...]]></description><category></category></item><item><title><![CDATA[LeetCode 101. Symmetric Tree]]></title><link>https://blog.youkuaiyun.com/pku_Coder/article/details/87577410</link><guid>https://blog.youkuaiyun.com/pku_Coder/article/details/87577410</guid><author>pku_Coder</author><pubDate>Mon, 18 Feb 2019 02:42:53 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/symmetric-tree/
Description
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
For example, this binary tree [1,2,2,3,4,4,3] i...]]></description><category></category></item><item><title><![CDATA[LeetCode 97. Interleaving String]]></title><link>https://blog.youkuaiyun.com/pku_Coder/article/details/87460774</link><guid>https://blog.youkuaiyun.com/pku_Coder/article/details/87460774</guid><author>pku_Coder</author><pubDate>Sat, 16 Feb 2019 17:45:49 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/interleaving-string/
Description
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.
Example 1:

Input: s1 = &quot;aabcc&quot;, s2 = &quot;dbbca&quot;, s3 = &quot;aadbbc...]]></description><category></category></item><item><title><![CDATA[LeetCode 96. Unique Binary Search Trees]]></title><link>https://blog.youkuaiyun.com/pku_Coder/article/details/87457923</link><guid>https://blog.youkuaiyun.com/pku_Coder/article/details/87457923</guid><author>pku_Coder</author><pubDate>Sat, 16 Feb 2019 16:59:16 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/unique-binary-search-trees/
Description
Given n, how many structurally unique BST’s (binary search trees) that store values 1 … n?
Example:
Input: 3
Output: 5

Explanatio...]]></description><category></category></item><item><title><![CDATA[LeetCode 85. Maximal Rectangle]]></title><link>https://blog.youkuaiyun.com/pku_Coder/article/details/87379426</link><guid>https://blog.youkuaiyun.com/pku_Coder/article/details/87379426</guid><author>pku_Coder</author><pubDate>Fri, 15 Feb 2019 18:54:53 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/maximal-rectangle/
Description
Given a 2D binary matrix filled with 0’s and 1’s, find the largest rectangle containing only 1’s and return its area.
Example:
Input:
[
  [...]]></description><category></category></item><item><title><![CDATA[LeetCode 84. Largest Rectangle in Histogram]]></title><link>https://blog.youkuaiyun.com/pku_Coder/article/details/87315572</link><guid>https://blog.youkuaiyun.com/pku_Coder/article/details/87315572</guid><author>pku_Coder</author><pubDate>Fri, 15 Feb 2019 01:41:51 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/largest-rectangle-in-histogram/
Description
Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of large...]]></description><category></category></item><item><title><![CDATA[LeetCode 87. Scramble String]]></title><link>https://blog.youkuaiyun.com/pku_Coder/article/details/87183697</link><guid>https://blog.youkuaiyun.com/pku_Coder/article/details/87183697</guid><author>pku_Coder</author><pubDate>Wed, 13 Feb 2019 15:14:37 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/scramble-string/
Description
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.
Below is one possible rep...]]></description><category></category></item><item><title><![CDATA[Inplace ABNSync 与 pytorch GPU多卡并行的一点坑]]></title><link>https://blog.youkuaiyun.com/pku_Coder/article/details/85111082</link><guid>https://blog.youkuaiyun.com/pku_Coder/article/details/85111082</guid><author>pku_Coder</author><pubDate>Thu, 20 Dec 2018 02:13:28 +0800</pubDate><description><![CDATA[pytorch GPU多卡并行的一点坑说在前头1、torch.cuda()2、ninja 的问题3、libcudart.so.9.1 找不到4、os.environ[&amp;amp;quot;CUDA_VISIBLE_DEVICES&amp;amp;quot;] 设置无效5、 Inplace ABNSync 使用中的编译相关问题6、Inplace ABNSync 同步时卡住不动
说在前头
众所周知，torch.nn.DataParallel(va...]]></description><category></category></item><item><title><![CDATA[Ubuntu 18.04和windows建立共享文件夹]]></title><link>https://blog.youkuaiyun.com/pku_Coder/article/details/82817248</link><guid>https://blog.youkuaiyun.com/pku_Coder/article/details/82817248</guid><author>pku_Coder</author><pubDate>Sat, 22 Sep 2018 20:16:52 +0800</pubDate><description><![CDATA[1、安装samba
sudo apt install samba

 sudo apt install cifs-utils
2、创建共享目录
mkdir /home/yourname/share (yourname是home下一个文件夹，自己新建)
sudo chmod 777 mkdir /home/yourname/share
3、创建samba配置文件并拷贝副本
sudo cp /etc/...]]></description><category></category></item><item><title><![CDATA[Dilated Convolutions]]></title><link>https://blog.youkuaiyun.com/pku_Coder/article/details/82776335</link><guid>https://blog.youkuaiyun.com/pku_Coder/article/details/82776335</guid><author>pku_Coder</author><pubDate>Wed, 19 Sep 2018 18:23:33 +0800</pubDate><description><![CDATA[1. 扩张卷积
Dilated Convolutions，翻译为扩张卷积或空洞卷积。扩张卷积与普通的卷积相比，除了卷积核的大小以外，还有一个扩张率(dilation rate)参数，主要用来表示扩张的大小。扩张卷积与普通卷积的相同点在于，卷积核的大小是一样的，在神经网络中即参数数量不变，区别在于扩张卷积具有更大的感受野。感受野是卷积核在图像上看到的大小，或者说卷积后的图像上，一个像素点对应着原图中...]]></description><category></category></item><item><title><![CDATA[双线性插值算法以及python实现]]></title><link>https://blog.youkuaiyun.com/pku_Coder/article/details/82690128</link><guid>https://blog.youkuaiyun.com/pku_Coder/article/details/82690128</guid><author>pku_Coder</author><pubDate>Thu, 13 Sep 2018 16:24:11 +0800</pubDate><description><![CDATA[




双线性插值算法【文章主题内容为转载，代码为自己所写】，在这里也感谢一些大牛的博文。

http://www.cnblogs.com/linkr/p/3630902.html

http://www.cnblogs.com/funny-world/p/3162003.html

双线性插值

&amp;amp;nbsp; &amp;amp;nbsp; &amp;amp;nbsp; 假设源图像大小为mxn，目标图像为axb。那么两幅图像的...]]></description><category></category></item><item><title><![CDATA[HMM和Viterbi算法]]></title><link>https://blog.youkuaiyun.com/pku_Coder/article/details/82627986</link><guid>https://blog.youkuaiyun.com/pku_Coder/article/details/82627986</guid><author>pku_Coder</author><pubDate>Tue, 11 Sep 2018 16:29:55 +0800</pubDate><description><![CDATA[一、隐马尔可夫模型（Hidden Markov Model）

1、简介

　　隐含马尔可夫模型并不是俄罗斯数学家马尔可夫发明的，而是美国数学家鲍姆提出的，隐含马尔可夫模型的训练方法（鲍姆-韦尔奇算法）也是以他名字命名的。隐含马尔可夫模型一直被认为是解决大多数自然语言处理问题最为快速、有效的方法。

2、马尔可夫假设

　　随机过程中各个状态St的概率分布，只与它的前一个状态St-1有关，即P(S...]]></description><category></category></item><item><title><![CDATA[Leetcode 79. Word Search]]></title><link>https://blog.youkuaiyun.com/pku_Coder/article/details/82499230</link><guid>https://blog.youkuaiyun.com/pku_Coder/article/details/82499230</guid><author>pku_Coder</author><pubDate>Fri, 07 Sep 2018 16:49:54 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/word-search/description/

example

board =
[
  ['A','B','C','E'],
  ['S','F','C','S'],
  ['A','D','E','E']
]

Given word = &quot;ABCCED&quot;, return true.
Given word = &quot;SEE&quot;, retu...]]></description><category></category></item><item><title><![CDATA[去除百度右侧广告栏的插件]]></title><link>https://blog.youkuaiyun.com/pku_Coder/article/details/81058955</link><guid>https://blog.youkuaiyun.com/pku_Coder/article/details/81058955</guid><author>pku_Coder</author><pubDate>Mon, 16 Jul 2018 00:39:42 +0800</pubDate><description><![CDATA[https://greasyfork.org/zh-CN/scripts/14178-ac-baidu-%E4%BC%98%E5%8C%96%E7%99%BE%E5%BA%A6-%E6%90%9C%E7%8B%97-%E8%B0%B7%E6%AD%8C%E6%90%9C%E7%B4%A2%E7%BB%93%E6%9E%9C%E4%B9%8B%E9%87%8D%E5%AE%9A%E5%90%91%E...]]></description><category></category></item><item><title><![CDATA[POJ 滑动窗口(优先队列的应用)]]></title><link>https://blog.youkuaiyun.com/pku_Coder/article/details/80999042</link><guid>https://blog.youkuaiyun.com/pku_Coder/article/details/80999042</guid><author>pku_Coder</author><pubDate>Wed, 11 Jul 2018 13:18:59 +0800</pubDate><description><![CDATA[数据结构与算法A (第三章 栈与队列 练习题): 滑动窗口



思路

对于最大最小值分别维护一个优先队列（保存元素下标）。以最小值为例。 
每次遇到一个新元素，从队尾插入。插入时删去队列中比该值大的元素。（因为当前值出现的下标较晚，所以以后一定范围窗口的最小值不会超过该值）。队首是当前窗口的最小值。同时要注意维护队首的下标是否在当前窗口内。



#include &amp;lt;iostream&amp;g...]]></description><category></category></item><item><title><![CDATA[POJ 数据结构与算法A 0407:去除C程序中的注释]]></title><link>https://blog.youkuaiyun.com/pku_Coder/article/details/80994148</link><guid>https://blog.youkuaiyun.com/pku_Coder/article/details/80994148</guid><author>pku_Coder</author><pubDate>Wed, 11 Jul 2018 00:39:45 +0800</pubDate><description><![CDATA[http://dsa.openjudge.cn/string/0407/ 
直接贴代码，注释说明的很详细。



#include &amp;lt;iostream&amp;gt;
#include &amp;lt;algorithm&amp;gt;
#include &amp;lt;string&amp;gt;
#include &amp;lt;cstring&amp;gt;
#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;vect...]]></description><category></category></item><item><title><![CDATA[KMP 算法的应用]]></title><link>https://blog.youkuaiyun.com/pku_Coder/article/details/80993852</link><guid>https://blog.youkuaiyun.com/pku_Coder/article/details/80993852</guid><author>pku_Coder</author><pubDate>Tue, 10 Jul 2018 23:59:31 +0800</pubDate><description><![CDATA[KMP算法的应用主要体现在Next数组的计算方式上。Next数组含义如下： 
Next[i] = j， 表示下标 i 之前连续 j 个字符，和字符串开始的连续 j 个字符相同。这会带来很多应用。比如

1、POJ 2406:字符串乘方



#include &amp;lt;iostream&amp;gt;
#include &amp;lt;algorithm&amp;gt;
#include &amp;lt;string&amp;gt;
#i...]]></description><category></category></item><item><title><![CDATA[POJ 2255:重建二叉树]]></title><link>https://blog.youkuaiyun.com/pku_Coder/article/details/80953133</link><guid>https://blog.youkuaiyun.com/pku_Coder/article/details/80953133</guid><author>pku_Coder</author><pubDate>Sat, 07 Jul 2018 17:21:43 +0800</pubDate><description><![CDATA[http://bailian.openjudge.cn/practice/2255/



思路

在前序中找到根节点（每个前序串的第一个字符），然后在中序串中找到根节点的位置。前半部分是左子树，后半部分是右子树，递归输出。

#include &amp;lt;iostream&amp;gt;
#include &amp;lt;cstdio&amp;gt;

using namespace std;

string front,...]]></description><category></category></item></channel></rss>