<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[linest]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/linest00</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; linest00]]></copyright><item><title><![CDATA[python weibo sdk ]]></title><link>https://blog.youkuaiyun.com/linest00/article/details/84413226</link><guid>https://blog.youkuaiyun.com/linest00/article/details/84413226</guid><author>linest00</author><pubDate>Thu, 28 Mar 2013 14:22:15 +0800</pubDate><description><![CDATA[[code=&quot;python&quot;]
class _Callable(object):

    def __init__(self, client, name):
        self._client = client
        self._name = name

    def __getattr__(self, attr):
        if attr=='get'...]]></description><category></category></item><item><title><![CDATA[CAP原理]]></title><link>https://blog.youkuaiyun.com/linest00/article/details/84184442</link><guid>https://blog.youkuaiyun.com/linest00/article/details/84184442</guid><author>linest00</author><pubDate>Wed, 11 Apr 2012 18:29:46 +0800</pubDate><description><![CDATA[Brewer 理论

一致性(Consistency)可用性(Availability)分区容忍性(Partition tolerance)
不能同时兼顾，要有trade off


一致性（Consistency）：任何一个读操作总是能读取到之前完成的写操作结果，也就是在分布式环境中，多点的数据是一致的； 
可用性（Availability）：每一个操作总是能够在确定的时间内返回，...]]></description><category></category></item><item><title><![CDATA[console 输入输出]]></title><link>https://blog.youkuaiyun.com/linest00/article/details/84183642</link><guid>https://blog.youkuaiyun.com/linest00/article/details/84183642</guid><author>linest00</author><pubDate>Tue, 10 Apr 2012 17:06:32 +0800</pubDate><description><![CDATA[读EOF结尾
scanf返回读出变量数
如果没读出返回-1
EOF就是常量-1
[code=&quot;c&quot;]
while(scanf(&quot;%d %d&quot;,&amp;a,&amp;b)!=EOF)
{
}
[/code]

[code=&quot;c++&quot;]
while(cin&gt;&gt;a&gt;&gt;b)
{
}
[/code]


读字符串整行
scanf以空格分隔
gets以回车分隔

[code=&quot;c&q]]></description><category></category></item><item><title><![CDATA[ -1.#IND00]]></title><link>https://blog.youkuaiyun.com/linest00/article/details/84182869</link><guid>https://blog.youkuaiyun.com/linest00/article/details/84182869</guid><author>linest00</author><pubDate>Mon, 09 Apr 2012 16:40:22 +0800</pubDate><description><![CDATA[使用pow函数做开方操作 pow(-10,1/3.0)
结果是奇怪的-1.#IND00

查了一下原来pow的第一个参数要是正数，
so -pow(10,1/3.0)

类似的错误是sqrt(-1) 负数开平方也会同样报错...]]></description><category></category></item><item><title><![CDATA[malloc 和 calloc]]></title><link>https://blog.youkuaiyun.com/linest00/article/details/84180044</link><guid>https://blog.youkuaiyun.com/linest00/article/details/84180044</guid><author>linest00</author><pubDate>Tue, 03 Apr 2012 11:11:35 +0800</pubDate><description><![CDATA[两者都是从堆上申请空间

malloc只有一个参数，就是分配大小
calloc有两个参数，分别是元素数目和每个元素大小
calloc返回一个元素数组而malloc只返回一个空间整体

malloc分配的空间不会初始化
calloc分配时会初始化...]]></description><category></category></item><item><title><![CDATA[hadoop 实践]]></title><link>https://blog.youkuaiyun.com/linest00/article/details/84172873</link><guid>https://blog.youkuaiyun.com/linest00/article/details/84172873</guid><author>linest00</author><pubDate>Thu, 22 Mar 2012 10:20:12 +0800</pubDate><description><![CDATA[http://blog.youkuaiyun.com/dajuezhao/article/details/6591034
写的很好 保存留用~

一、背景

Hadoop的集群使用也有些时候了，不过都是小集群的使用（数量小于30台）。在这个过程中不断的进行着配置调优的操作。最早的时候，在网上也没有找到一些合适的配置调优方法，于是，我在这里列举一些基本的调优配置，以供参考。最后，还有一个我自己的测试环...]]></description><category></category></item><item><title><![CDATA[svn trunk branch  tag]]></title><link>https://blog.youkuaiyun.com/linest00/article/details/84167043</link><guid>https://blog.youkuaiyun.com/linest00/article/details/84167043</guid><author>linest00</author><pubDate>Mon, 12 Mar 2012 14:44:57 +0800</pubDate><description><![CDATA[简而言之 trunk就是开发中的代码主干
branch是从主干上产生的分支版本，可以和主干独立，并行继续开发
tag作为里程碑标记，一般只读，不再继续修改


略详细的如下：
http://developer.51cto.com/art/201005/201718.htm
在实现上，branch和tag，对于svn都是使用copy实现的，所以他们在默认的权限上和一般的目录没有区别。至...]]></description><category></category></item><item><title><![CDATA[python 细碎内容]]></title><link>https://blog.youkuaiyun.com/linest00/article/details/84166490</link><guid>https://blog.youkuaiyun.com/linest00/article/details/84166490</guid><author>linest00</author><pubDate>Sun, 11 Mar 2012 10:27:39 +0800</pubDate><description><![CDATA[http://www.coder4.com/archives/2239
[code=&quot;python&quot;]
#设a为字符串
import time
a = &quot;2011-09-28 10:00:00&quot;

#中间过程，一般都需要将字符串转化为时间数组
time.strptime(a,'%Y-%m-%d %H:%M:%S')
&gt;&gt;time.struct_time(tm_year=2011, ...]]></description><category></category></item><item><title><![CDATA[pat-1022 Digital Library ]]></title><link>https://blog.youkuaiyun.com/linest00/article/details/84159419</link><guid>https://blog.youkuaiyun.com/linest00/article/details/84159419</guid><author>linest00</author><pubDate>Mon, 27 Feb 2012 14:26:56 +0800</pubDate><description><![CDATA[可能的查询 ID值进行map映射   

以下代码有问题，原因是ID是整形保存，会忽略前面的0
[code=&quot;c++&quot;]
#include
using namespace std;
#include
#include
#include
#include
#include



int main()
{
	int N;
	map m;
	int ID;
	int...]]></description><category></category></item><item><title><![CDATA[pat-1016 Phone Bills]]></title><link>https://blog.youkuaiyun.com/linest00/article/details/84159139</link><guid>https://blog.youkuaiyun.com/linest00/article/details/84159139</guid><author>linest00</author><pubDate>Mon, 27 Feb 2012 00:01:11 +0800</pubDate><description><![CDATA[
Sample Input:10 10 10 10 10 10 20 20 20 15 15 15 15 15 15 15 20 30 20 15 15 10 10 10
10
CYLL 01:01:06:01 on-line
CYLL 01:28:16:05 off-line
CYJJ 01:01:07:00 off-line
CYLL 01:01:08:03 off-line
C...]]></description><category></category></item><item><title><![CDATA[pat-1018 Public Bike Management  有问题]]></title><link>https://blog.youkuaiyun.com/linest00/article/details/84159054</link><guid>https://blog.youkuaiyun.com/linest00/article/details/84159054</guid><author>linest00</author><pubDate>Sun, 26 Feb 2012 19:55:45 +0800</pubDate><description><![CDATA[最后一个case还过不了 ==
为什么呢

思路dfs遍历到目标的所有路径
找最短，运送最少，带回最少的路径

[code=&quot;c++&quot;]
#include 
#include 
#include
using namespace std;
#define MAXV 501
#define INFINITE 1000000000

int mindis = INFINITE...]]></description><category></category></item><item><title><![CDATA[pat-1017* Queueing at Bank ]]></title><link>https://blog.youkuaiyun.com/linest00/article/details/84158679</link><guid>https://blog.youkuaiyun.com/linest00/article/details/84158679</guid><author>linest00</author><pubDate>Sat, 25 Feb 2012 12:32:43 +0800</pubDate><description><![CDATA[银行8点至17点开 有固定窗口数

来早了要等，没窗口要等，17点后才来就无视

求平均等待时间， 被无视的不统计

注意不是17点一定关门，只要是17点前来的都要服务，即使可能超时

下面代码完全模拟秒数，先排序顾客，滤掉17点后来的
对于每一秒，检查窗口的情况
总体思路是以时间为中心
[code=&quot;c++&quot;]
#include
using namespace std;...]]></description><category></category></item><item><title><![CDATA[pat-1021* Deepest Root ]]></title><link>https://blog.youkuaiyun.com/linest00/article/details/84158562</link><guid>https://blog.youkuaiyun.com/linest00/article/details/84158562</guid><author>linest00</author><pubDate>Sat, 25 Feb 2012 00:36:00 +0800</pubDate><description><![CDATA[判断图是否都连接构成树，求使树高最大的根

实际上求图上两点间最大距离

先用并查集判断共有几个部分

bfs求距离
先任取一点开始bfs，得到最远的叶节点
以此叶节点再bfs可得

[code=&quot;c++&quot;]
#include
using namespace std;
#include
#include
#include
#include
#include
#i...]]></description><category></category></item><item><title><![CDATA[pat-1020* Tree Traversals ]]></title><link>https://blog.youkuaiyun.com/linest00/article/details/84157673</link><guid>https://blog.youkuaiyun.com/linest00/article/details/84157673</guid><author>linest00</author><pubDate>Thu, 23 Feb 2012 15:20:15 +0800</pubDate><description><![CDATA[给后序和中序遍历
求层序遍历

Sample Input:7
2 3 1 5 7 6 4
1 2 3 4 5 6 7

Sample Output:4 1 6 3 5 7 2

注意如果是按char型处理，还要考虑多字符情况  如12
在输入上要加以处理，用int比较简单

[code=&quot;c++&quot;]
#include &quot;stdio.h&quot;
#include &quot;stdlib...]]></description><category></category></item><item><title><![CDATA[pat-1019 General Palindromic Number ]]></title><link>https://blog.youkuaiyun.com/linest00/article/details/84157328</link><guid>https://blog.youkuaiyun.com/linest00/article/details/84157328</guid><author>linest00</author><pubDate>Thu, 23 Feb 2012 00:26:35 +0800</pubDate><description><![CDATA[判断数字在给定进制下是否回文
并打出进制转换后系数

思路，将所有系数存起来处理

[code=&quot;c++&quot;]
#include
using namespace std;
#include
#include



int main()
{
	vector v;
	vector rv;
	int num;
	int base;
	cin&gt;&gt;num;
	cin&gt;&gt;...]]></description><category></category></item><item><title><![CDATA[pat-1024 Palindromic Number ]]></title><link>https://blog.youkuaiyun.com/linest00/article/details/84155492</link><guid>https://blog.youkuaiyun.com/linest00/article/details/84155492</guid><author>linest00</author><pubDate>Mon, 20 Feb 2012 00:56:42 +0800</pubDate><description><![CDATA[如果不是回文则进行逆序相加操作，打印出最后回文和操作次数

题目中说数字可达到10的10次方  迭代可100次
则每次相加次数可能因进位多一位，longlong型只能19位可能不够

实现重点，字符串相加
注意求进位时也要带上carry

以下代码数值型会溢出
[code=&quot;c++&quot;]
#include
using namespace std;


long long ...]]></description><category></category></item><item><title><![CDATA[pat-1025 PAT Ranking]]></title><link>https://blog.youkuaiyun.com/linest00/article/details/84155343</link><guid>https://blog.youkuaiyun.com/linest00/article/details/84155343</guid><author>linest00</author><pubDate>Sun, 19 Feb 2012 15:45:07 +0800</pubDate><description><![CDATA[不同地点一起排序
先组内排序，再全局排序 
将小组添加进全局

vector拼接
globallist.insert(globallist.end(),locallist.begin(),locallist.end());  


[code=&quot;c++&quot;]
#include
using namespace std;
#include
#include
#include
...]]></description><category></category></item><item><title><![CDATA[pat-1023 Have Fun with Numbers ]]></title><link>https://blog.youkuaiyun.com/linest00/article/details/84155219</link><guid>https://blog.youkuaiyun.com/linest00/article/details/84155219</guid><author>linest00</author><pubDate>Sun, 19 Feb 2012 00:26:55 +0800</pubDate><description><![CDATA[判断一个数乘2后是否是原数的一个排列

思路：
int最大值 2147483647  10位
longlong 最大值 9223372036854775807  19位
不满足题目20位  故不能数值型  只能字符串处理

考虑乘积后进位问题

排列的判断用二进制移位求和即可，和值相等即为排列。  

[code=&quot;c++&quot;]
#include
using namespa...]]></description><category></category></item><item><title><![CDATA[读代码-BayesFileFormatter]]></title><link>https://blog.youkuaiyun.com/linest00/article/details/84148429</link><guid>https://blog.youkuaiyun.com/linest00/article/details/84148429</guid><author>linest00</author><pubDate>Fri, 03 Feb 2012 22:51:26 +0800</pubDate><description><![CDATA[用到： 文件读写,文件夹下遍历文件处理

package org.apache.mahout.classifier;
public final class BayesFileFormatter

提供了两个处理方式
将文件夹下所有文件处理后写入单一文档，和文件分别写入文档

单文档
[code=&quot;java&quot;]
  public static void collapse(Stri...]]></description><category></category></item><item><title><![CDATA[读代码-MinHashDriver及相关]]></title><link>https://blog.youkuaiyun.com/linest00/article/details/84131151</link><guid>https://blog.youkuaiyun.com/linest00/article/details/84131151</guid><author>linest00</author><pubDate>Thu, 26 Jan 2012 14:17:41 +0800</pubDate><description><![CDATA[用到：泛型类   counter  哈希实现

package org.apache.mahout.clustering.minhash;
public final class MinHashDriver extends AbstractJob

输入Sequence格式
输出根据debug模式可选向量和文本格式，文件可以Sequence和Text格式

[code=&quot;java&quot;]...]]></description><category></category></item></channel></rss>