<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[chender_sysu的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/chender_sysu</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; chender_sysu]]></copyright><item><title><![CDATA[Ubuntu下修改DNS服务器地址]]></title><link>https://blog.youkuaiyun.com/chender_sysu/article/details/69489658</link><guid>https://blog.youkuaiyun.com/chender_sysu/article/details/69489658</guid><author>chender_sysu</author><pubDate>Fri, 07 Apr 2017 00:21:14 +0800</pubDate><description><![CDATA[今天刚装了Ubuntu系统，想修改dns地址，结果网上找了很多方法都解决不了。后来通过直接修改系统文件解决。步骤如下： 
1、打开终端，输入以下命令行后打开文件并进行编辑
  sudo gedit /etc/resolv.conf
2、将文件中原dns地址注释掉或删掉，改为自己想要设置的dns地址。 
即修改nameserver后的地址。 
如：
  nameserver 10.8.8.8 
  n]]></description><category></category></item><item><title><![CDATA[Python学习记录六-ubuntu下升级pip报错]]></title><link>https://blog.youkuaiyun.com/chender_sysu/article/details/69388907</link><guid>https://blog.youkuaiyun.com/chender_sysu/article/details/69388907</guid><author>chender_sysu</author><pubDate>Thu, 06 Apr 2017 13:56:37 +0800</pubDate><description><![CDATA[今天在Ubuntu下尝试安装Python的一些机器学习相关学习的库，使用pip命令提示
  You are using pip version 8.1.1, however version 9.0.1 is available.
使用
  pip install –upgrade pip命令报错为 
  Requirement already up-to-date: pip in ./anacond]]></description><category></category></item><item><title><![CDATA[C++(后台开发面试题)-判断数组中是否存在重复元素]]></title><link>https://blog.youkuaiyun.com/chender_sysu/article/details/64906546</link><guid>https://blog.youkuaiyun.com/chender_sysu/article/details/64906546</guid><author>chender_sysu</author><pubDate>Wed, 22 Mar 2017 11:43:15 +0800</pubDate><description><![CDATA[今天进行了今日头条一轮的技术面试，面试官问了这样一道题，给定一个数组，长度为n，数组中的元素均为整数，范围是[0,n-1]，问如何判断数组中是否出现重复数字。]]></description><category></category></item><item><title><![CDATA[Python学习记录五]]></title><link>https://blog.youkuaiyun.com/chender_sysu/article/details/61428412</link><guid>https://blog.youkuaiyun.com/chender_sysu/article/details/61428412</guid><author>chender_sysu</author><pubDate>Sat, 11 Mar 2017 20:59:56 +0800</pubDate><description><![CDATA[numpy，matplotlib，sklearn
使用pip install scipy安装scipy模块报错]]></description><category></category></item><item><title><![CDATA[属性类型-区间与比率的理解]]></title><link>https://blog.youkuaiyun.com/chender_sysu/article/details/60868504</link><guid>https://blog.youkuaiyun.com/chender_sysu/article/details/60868504</guid><author>chender_sysu</author><pubDate>Wed, 08 Mar 2017 10:57:38 +0800</pubDate><description><![CDATA[在学习《数据挖掘导论》数据这一章时，对属性类型中的区间和比率这两个的区别理解不好，在博客上看到一篇解释得不错的文章，就转载当做记录。
原文如下：
现在正在学习《数据挖掘导论》数据这一章，下面是我对数据的属性类型-区间比率的一点理解。
书上的描述：
区间：对于区间属性，值之间的差是有意义的，即存在测量单位。如日历日期、摄氏或华氏温度
比率：对于比率属性，差和比率都是有意义的。如绝对温度、货]]></description><category></category></item><item><title><![CDATA[Python学习记录四]]></title><link>https://blog.youkuaiyun.com/chender_sysu/article/details/59197941</link><guid>https://blog.youkuaiyun.com/chender_sysu/article/details/59197941</guid><author>chender_sysu</author><pubDate>Wed, 01 Mar 2017 23:30:36 +0800</pubDate><description><![CDATA[window下安装pandas模块]]></description><category></category></item><item><title><![CDATA[Python学习记录三]]></title><link>https://blog.youkuaiyun.com/chender_sysu/article/details/59057546</link><guid>https://blog.youkuaiyun.com/chender_sysu/article/details/59057546</guid><author>chender_sysu</author><pubDate>Wed, 01 Mar 2017 10:30:44 +0800</pubDate><description><![CDATA[SyntaxError: Non-ASCII character ‘\xe6]]></description><category></category></item><item><title><![CDATA[Python学习记录二]]></title><link>https://blog.youkuaiyun.com/chender_sysu/article/details/58586602</link><guid>https://blog.youkuaiyun.com/chender_sysu/article/details/58586602</guid><author>chender_sysu</author><pubDate>Tue, 28 Feb 2017 10:11:00 +0800</pubDate><description><![CDATA[今天在尝试使用Python抓取网页中内容的时候，遇到了一个问题-就是控制台中文输出乱码的问题。 
Python的第三方库chardet，]]></description><category></category></item><item><title><![CDATA[Python学习记录一]]></title><link>https://blog.youkuaiyun.com/chender_sysu/article/details/57563265</link><guid>https://blog.youkuaiyun.com/chender_sysu/article/details/57563265</guid><author>chender_sysu</author><pubDate>Sun, 26 Feb 2017 23:06:29 +0800</pubDate><description><![CDATA[python学习]]></description><category></category></item><item><title><![CDATA[LeetCode学习篇二十七——Maximum Subarray]]></title><link>https://blog.youkuaiyun.com/chender_sysu/article/details/53464912</link><guid>https://blog.youkuaiyun.com/chender_sysu/article/details/53464912</guid><author>chender_sysu</author><pubDate>Mon, 05 Dec 2016 14:22:18 +0800</pubDate><description><![CDATA[题目：Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4], 
the contiguous subarray [4,-1,2,1] has]]></description><category></category></item><item><title><![CDATA[LeetCode学习篇二十六——Maximum Product Subarray]]></title><link>https://blog.youkuaiyun.com/chender_sysu/article/details/53464651</link><guid>https://blog.youkuaiyun.com/chender_sysu/article/details/53464651</guid><author>chender_sysu</author><pubDate>Mon, 05 Dec 2016 13:55:37 +0800</pubDate><description><![CDATA[题目：Find the contiguous subarray within an array (containing at least one number) which has the largest product.]]></description><category></category></item><item><title><![CDATA[算法概论8.15题解]]></title><link>https://blog.youkuaiyun.com/chender_sysu/article/details/53410454</link><guid>https://blog.youkuaiyun.com/chender_sysu/article/details/53410454</guid><author>chender_sysu</author><pubDate>Wed, 30 Nov 2016 17:20:35 +0800</pubDate><description><![CDATA[题目：证明以下问题是NP完全问题
最大公共子图
输入：两个图G1=(V1,E1)和G2=(V2,E2);预算b
输出：两个节点集合V1'⊆V1且V2'⊆V2，它们被移除后，将在两图中剩下至少b个节点，且图的剩余部分完全一样。


首先证明该问题是NP问题
给定一组解，即两个节点集合，我们可以在多项式时间内验证该解
然后证明该问题是NP难问题
考虑将最大独立集问题归约到最大公共子图]]></description><category></category></item><item><title><![CDATA[算法概论8.3题解]]></title><link>https://blog.youkuaiyun.com/chender_sysu/article/details/53409147</link><guid>https://blog.youkuaiyun.com/chender_sysu/article/details/53409147</guid><author>chender_sysu</author><pubDate>Wed, 30 Nov 2016 16:43:28 +0800</pubDate><description><![CDATA[题目：吝啬SAT是这样一种问题：给定一组子句（每个子句都是其中文字的析取）和一个整数k，求一个最多有k个变量为true的满足赋值，如果这样的赋值存在的话。证明吝啬SAT问题是NP完全问题。
要证明一个问题是NP完全问题，就要证明它是NP的和NP-Hard的
首先证明吝啬SAT是NP的
很明显，给定一组文字的赋值，我们能在多项式时间内验证该解，因此是NP的。
然后证明吝啬SAT是NP-Har]]></description><category></category></item><item><title><![CDATA[LeetCode学习篇二十五——Balanced Binary Tree]]></title><link>https://blog.youkuaiyun.com/chender_sysu/article/details/53286691</link><guid>https://blog.youkuaiyun.com/chender_sysu/article/details/53286691</guid><author>chender_sysu</author><pubDate>Tue, 22 Nov 2016 15:32:35 +0800</pubDate><description><![CDATA[题目：Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ]]></description><category></category></item><item><title><![CDATA[LeetCode学习篇二十四——Path Sum II]]></title><link>https://blog.youkuaiyun.com/chender_sysu/article/details/53286166</link><guid>https://blog.youkuaiyun.com/chender_sysu/article/details/53286166</guid><author>chender_sysu</author><pubDate>Tue, 22 Nov 2016 15:01:24 +0800</pubDate><description><![CDATA[题目：Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.For example:]]></description><category></category></item><item><title><![CDATA[LeetCode学习篇二十三——Path Sum]]></title><link>https://blog.youkuaiyun.com/chender_sysu/article/details/53285780</link><guid>https://blog.youkuaiyun.com/chender_sysu/article/details/53285780</guid><author>chender_sysu</author><pubDate>Tue, 22 Nov 2016 14:42:18 +0800</pubDate><description><![CDATA[题目：Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:]]></description><category></category></item><item><title><![CDATA[LeetCode学习篇二十二——Decode String]]></title><link>https://blog.youkuaiyun.com/chender_sysu/article/details/53193407</link><guid>https://blog.youkuaiyun.com/chender_sysu/article/details/53193407</guid><author>chender_sysu</author><pubDate>Thu, 17 Nov 2016 00:08:16 +0800</pubDate><description><![CDATA[题目：Given an encoded string, return it’s decoded string.The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is gua]]></description><category></category></item><item><title><![CDATA[最大流最小割定理（max flow/min cut theory）]]></title><link>https://blog.youkuaiyun.com/chender_sysu/article/details/53186512</link><guid>https://blog.youkuaiyun.com/chender_sysu/article/details/53186512</guid><author>chender_sysu</author><pubDate>Wed, 16 Nov 2016 14:50:01 +0800</pubDate><description><![CDATA[网络与流的概念

  对于有向图D=(V,A)，如果V中有一发点（源）Vs，一收点（汇）Vt，其余均为中间节点，且对A中的每条弧均有权Wij（称为弧容量），则称这样的赋权有向图D为容量网络，记为D=(V,A,W)，通过D中弧(Vi,Vj)的物流量为fij，称为弧(Vi,Vj)的流量。所有弧上流量的集合f={fij}称为该网络D的一个流。

最大流最小割定理（max flow/min cut]]></description><category></category></item><item><title><![CDATA[LeetCode学习篇二十一——Interge Break]]></title><link>https://blog.youkuaiyun.com/chender_sysu/article/details/53099053</link><guid>https://blog.youkuaiyun.com/chender_sysu/article/details/53099053</guid><author>chender_sysu</author><pubDate>Wed, 09 Nov 2016 13:59:30 +0800</pubDate><description><![CDATA[题目：Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.For example, given n = 2, retur]]></description><category></category></item><item><title><![CDATA[LeetCode学习篇二十——Bulls and Cows]]></title><link>https://blog.youkuaiyun.com/chender_sysu/article/details/53071954</link><guid>https://blog.youkuaiyun.com/chender_sysu/article/details/53071954</guid><author>chender_sysu</author><pubDate>Mon, 07 Nov 2016 21:21:03 +0800</pubDate><description><![CDATA[题目：You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide a hint t]]></description><category></category></item></channel></rss>