<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[BetaCZH的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/code_vs</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; code_vs]]></copyright><item><title><![CDATA[原博客域名更换]]></title><link>https://blog.youkuaiyun.com/code_vs/article/details/79035023</link><guid>https://blog.youkuaiyun.com/code_vs/article/details/79035023</guid><author>code_vs</author><pubDate>Thu, 11 Jan 2018 15:45:12 +0800</pubDate><description><![CDATA[据说百度无法爬取github page上的博客 很烦恼 于是把搬到了coding page下 所以博客域名更换为  



loveSnowBest’s blog (http://lovesnowbest.site)

欢迎来玩～]]></description><category></category></item><item><title><![CDATA[KMP算法小学生理解]]></title><link>https://blog.youkuaiyun.com/code_vs/article/details/78158274</link><guid>https://blog.youkuaiyun.com/code_vs/article/details/78158274</guid><author>code_vs</author><pubDate>Wed, 04 Oct 2017 15:30:56 +0800</pubDate><description><![CDATA[KMP算法小学生理解1.简介看毛片算法可谓无人不知，相比于朴素字符串匹配，kmp算法将时间复杂度从o(N*M)缩减为o(N+M)，实在为一大进步。其中N为模式串的长度，M为要从中寻找字符串的长度。概括的来说，我们首先对模式串进行一些列的打表，然后对M字串遍历就可以了。下面详细地讲一下这个kmp  2.kmp详解首先，朴素算法之所以可以被优化，其实是因为在匹配的过程中做了重复运算，举个例子来说把，如果]]></description><category></category></item><item><title><![CDATA[Data lab(two complements arithmetic)]]></title><link>https://blog.youkuaiyun.com/code_vs/article/details/77938736</link><guid>https://blog.youkuaiyun.com/code_vs/article/details/77938736</guid><author>code_vs</author><pubDate>Mon, 11 Sep 2017 22:20:58 +0800</pubDate><description><![CDATA[Data lab(two complements arithmetic)1.bitAndThis is a simple function, we learnt about this in discrete math in the last term.  /* 
 * bitAnd - x&y using only ~ and | 
 *   Example: bitAnd(6, 5) = 4
 *]]></description><category></category></item><item><title><![CDATA[python图片字符画]]></title><link>https://blog.youkuaiyun.com/code_vs/article/details/77531879</link><guid>https://blog.youkuaiyun.com/code_vs/article/details/77531879</guid><author>code_vs</author><pubDate>Thu, 24 Aug 2017 16:30:30 +0800</pubDate><description><![CDATA[how to generate a char picture.1.install pillow.  2.import Image&&import argsparse.  argsparse is used for dealing with args,width,height.etc.  3.get_char() functionOur purpose is to get each pixel of]]></description><category></category></item><item><title><![CDATA[support vector machine简介]]></title><link>https://blog.youkuaiyun.com/code_vs/article/details/77241283</link><guid>https://blog.youkuaiyun.com/code_vs/article/details/77241283</guid><author>code_vs</author><pubDate>Wed, 16 Aug 2017 12:48:28 +0800</pubDate><description><![CDATA[support vector machine.第一次了解svm是在Andrew的公开课上，可惜他讲的比较浅，仅仅介绍了一点基础知识，包括一些术语都没有涉及。然而最近在看machine learning in action里面也有一章专门讲svm的，可惜英语不过关只能先找中文的看看然后才能看英文的。。。于是我看了许多关于（不算许多）svm的博客，发现这东西博大精深，可挖的东西很多，特此写下来总结一下，]]></description><category></category></item><item><title><![CDATA[2017.8.7所感]]></title><link>https://blog.youkuaiyun.com/code_vs/article/details/76863631</link><guid>https://blog.youkuaiyun.com/code_vs/article/details/76863631</guid><author>code_vs</author><pubDate>Tue, 08 Aug 2017 00:31:05 +0800</pubDate><description><![CDATA[昨天晚上玩手机完的比较晚，大概3点才睡，今天早上11点才起床。平常9点多差不多就开始看书了。不过想想自己看了这么长时间了也不差这两个小时。其实我私下认为自己够努力了，或者说对自己这个暑假的作息还是比较满意的。可是今天下午由于换电脑要给github添加新的ssh的地址就问樵总一些东西，顺带翻了他的blog。看比自己强的人写的东西总是心怀敬畏的，而这些人却又偏偏写的自己很是谦虚，于是我看完之后感觉自己什]]></description><category></category></item><item><title><![CDATA[背包问题复习2]]></title><link>https://blog.youkuaiyun.com/code_vs/article/details/76851439</link><guid>https://blog.youkuaiyun.com/code_vs/article/details/76851439</guid><author>code_vs</author><pubDate>Mon, 07 Aug 2017 17:01:15 +0800</pubDate><description><![CDATA[背包问题复习21.对于数据量变大的01背包问题题目： 
 
想法：首先这题的size和bag都很大，如果直接用动态规划套原来的模板肯定不行，但是我们发现对于value的值比较小。那么我们不妨反过来想这个问题，我们记录对于选到第n个物品，价值达到j的重量最小的情况。这样最后达到的目标肯定是装的最多的。 
code:#include<iostream>
#include <memory.h>
#defi]]></description><category></category></item><item><title><![CDATA[背包问题复习]]></title><link>https://blog.youkuaiyun.com/code_vs/article/details/76780974</link><guid>https://blog.youkuaiyun.com/code_vs/article/details/76780974</guid><author>code_vs</author><pubDate>Sun, 06 Aug 2017 17:00:57 +0800</pubDate><description><![CDATA[背包问题复习vijos 1025想法：记忆化搜索，或者动态规划都行，基础题。  
code：  #include<iostream>
#include<memory.h>
using namespace std;
int n,size;
int value[105],bag[105];
int record[105][1500];
int search(int count,int rest){]]></description><category></category></item><item><title><![CDATA[python 学习笔记6]]></title><link>https://blog.youkuaiyun.com/code_vs/article/details/76768957</link><guid>https://blog.youkuaiyun.com/code_vs/article/details/76768957</guid><author>code_vs</author><pubDate>Sun, 06 Aug 2017 14:19:10 +0800</pubDate><description><![CDATA[learning python notes 6Objected Oriented Programming(senior)1.__slots__In python, we can dynamically bind method or attribute to an instance. e.g.  class Student(object):
    pass
def setName(self,name]]></description><category></category></item><item><title><![CDATA[python 学习笔记5]]></title><link>https://blog.youkuaiyun.com/code_vs/article/details/76735925</link><guid>https://blog.youkuaiyun.com/code_vs/article/details/76735925</guid><author>code_vs</author><pubDate>Sat, 05 Aug 2017 21:31:08 +0800</pubDate><description><![CDATA[python learning notes 5ModulePython has many useful modules preparing for us. e.g. sys   #!/usr/bin/env python3
# -*- coding: utf-8 -*-' plain text '
__author__='BetaCZH'
import sys      #  import sys]]></description><category></category></item><item><title><![CDATA[python 学习笔记4]]></title><link>https://blog.youkuaiyun.com/code_vs/article/details/76729949</link><guid>https://blog.youkuaiyun.com/code_vs/article/details/76729949</guid><author>code_vs</author><pubDate>Sat, 05 Aug 2017 18:01:55 +0800</pubDate><description><![CDATA[python learning notes 4functional programming1.high-order functionIn python, we don’t need to worry about elemtype. In other words, if we want a pointer points to a function, it’s won’t bother us to de]]></description><category></category></item><item><title><![CDATA[贪心算法poj 3617，3069，3253]]></title><link>https://blog.youkuaiyun.com/code_vs/article/details/76721173</link><guid>https://blog.youkuaiyun.com/code_vs/article/details/76721173</guid><author>code_vs</author><pubDate>Sat, 05 Aug 2017 15:15:13 +0800</pubDate><description><![CDATA[挑战程序设计竞赛greedy problempoj 3617 Best Cow Line想法：先生成一个反着的字符串，（其实就是从两边开始找）先取出两边相比较小的字符串。当然这里有个问题，就是两边的头一个字符相同时，比较下一个字符，直到比较完整个字串为止，找到较小的那边的第一个字符加上。其实用strcmp就可以很好的解决上面描述的操作。 
code:  #include <iostream>
#in]]></description><category></category></item><item><title><![CDATA[python 学习笔记3]]></title><link>https://blog.youkuaiyun.com/code_vs/article/details/76695522</link><guid>https://blog.youkuaiyun.com/code_vs/article/details/76695522</guid><author>code_vs</author><pubDate>Fri, 04 Aug 2017 21:45:15 +0800</pubDate><description><![CDATA[python learning notesSome senior attributes1.Slicecut a piece of elements from the whole container. 
sytnax:object[beginIndex endIndex (every x)] 
this provides us an easy way to get fragment of object]]></description><category></category></item><item><title><![CDATA[简单任务调度问题（贪心）]]></title><link>https://blog.youkuaiyun.com/code_vs/article/details/76695135</link><guid>https://blog.youkuaiyun.com/code_vs/article/details/76695135</guid><author>code_vs</author><pubDate>Fri, 04 Aug 2017 20:52:57 +0800</pubDate><description><![CDATA[simple task scheduling problemToday we will talk about task scheduling problem using greedy thinking. In fact, greedy algorithm is quite uncommon, for most problems in our life can not be solved just b]]></description><category></category></item><item><title><![CDATA[python 学习笔记2]]></title><link>https://blog.youkuaiyun.com/code_vs/article/details/76687953</link><guid>https://blog.youkuaiyun.com/code_vs/article/details/76687953</guid><author>code_vs</author><pubDate>Fri, 04 Aug 2017 16:36:44 +0800</pubDate><description><![CDATA[python learning notes 2.functionIt’s similiar to c in function. One thing to mention, library function the return value of hex() is a str not a number. So you can do abs() on hex(num).  define your own]]></description><category></category></item><item><title><![CDATA[python 学习笔记]]></title><link>https://blog.youkuaiyun.com/code_vs/article/details/76675259</link><guid>https://blog.youkuaiyun.com/code_vs/article/details/76675259</guid><author>code_vs</author><pubDate>Fri, 04 Aug 2017 12:06:50 +0800</pubDate><description><![CDATA[python learning notes 11.list && tuple  list is similiar to array in c. But python will check if index is out of range. Also, you can index the last element by using index -1. 
 function:  
append().]]></description><category></category></item><item><title><![CDATA[哈希算法简介]]></title><link>https://blog.youkuaiyun.com/code_vs/article/details/76618732</link><guid>https://blog.youkuaiyun.com/code_vs/article/details/76618732</guid><author>code_vs</author><pubDate>Thu, 03 Aug 2017 14:15:27 +0800</pubDate><description><![CDATA[introduction to HashTable1.What is hash?HashTable is a kind of map. The search process in hashtable holds o(1) complexity. You may think o(1), that’s impossible, since you need to traversal all the con]]></description><category></category></item><item><title><![CDATA[约瑟夫问题（动态规划解法）]]></title><link>https://blog.youkuaiyun.com/code_vs/article/details/76575982</link><guid>https://blog.youkuaiyun.com/code_vs/article/details/76575982</guid><author>code_vs</author><pubDate>Wed, 02 Aug 2017 13:09:00 +0800</pubDate><description><![CDATA[Josephus problem solution with o(n)1.Description  
  People are standing in a circle waiting to be executed. Counting begins at a specified point in the circle and proceeds around the circle in a speci]]></description><category></category></item><item><title><![CDATA[快速求解组合数（筛法+快速幂）]]></title><link>https://blog.youkuaiyun.com/code_vs/article/details/76522388</link><guid>https://blog.youkuaiyun.com/code_vs/article/details/76522388</guid><author>code_vs</author><pubDate>Tue, 01 Aug 2017 13:52:10 +0800</pubDate><description><![CDATA[a quick way to calculate combinatorial number1.Why we need this method?  Anyone who know how to print helloworld is also able to write a code to calculate a combinatorial number. However, the calculati]]></description><category></category></item><item><title><![CDATA[筛法快速求解素数]]></title><link>https://blog.youkuaiyun.com/code_vs/article/details/76422387</link><guid>https://blog.youkuaiyun.com/code_vs/article/details/76422387</guid><author>code_vs</author><pubDate>Mon, 31 Jul 2017 10:50:19 +0800</pubDate><description><![CDATA[sieve methodreference:一般筛法求素数+快速线性筛法求素数1.naive method  enum k from 2 to √n, if num % k ,then it’s not a prime  2.normal sieve  First, let’s suppose all the nums are prime, from 2 to n. Second, for i=1:]]></description><category></category></item></channel></rss>