喜欢吃一口烤肉的啵啵

原创 【基础算法】hdu 1159 最长公共子序列

Common SubsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32410Accepted Submission(s): 14659Problem DescriptionA sub

原创 【基础算法】快速幂取余

Rightmost DigitTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 45421Accepted Submission(s): 17090Problem DescriptionGiven a

原创 poj4323 最短编辑距离

AGTCTime Limit:1000MSMemory Limit:65536KTotal Submissions:12240Accepted:4594DescriptionLetxandybe two strings over some finite alphabetA. We would li

原创 【基础算法】走10级楼梯题目解法总结

#include using namespace std;//递归 int handle1(int N){ if(N == 1) return 1; if(N == 2) return 2; if(N > 2){ return handle1(N-1)+handle1(N-2); } return 0;}//斐波那契数列 int handle2(int n){ n =

原创 【基础算法】利用priority_queue实现top K

#include using namespace std;class fix_priority_queue { int max_size; priority_queue , greater >q;public: fix_priority_queue( int max_size ) { this->max_size = max_size; } void add( i

原创 给定一个随机数范围，产生另一个随机数范围

#include using namespace std;int rand6(){ return rand()%6+1;} int rand7(){ int i = (rand6()-1)*6+rand6()-1; while(i > 34)i = (rand6()-1)*6+rand6()-1; //多出的35过滤掉。 不然会增加了获得1的概率 return i%7

原创 linux 权限值的表示

原创 【进阶算法】线段树求解区间最大最小值

#include using namespace std;#define MAXN 256int min_ar[MAXN*5];int max_ar[MAXN*5];int data[MAXN];void pushUp( int N ){ min_ar[N] = min( min_ar[2 * N], min_ar[2 * N + 1] ); max_ar[N] = max(

原创 【基础算法】最长不含重复的子串长度

#include using namespace std;int last[256];int maxLengthNoRepeat(string s){int start = 0;int maxLength = 0;fill(last,last+256,-1);int flag = 0;for(int i=0;i!=s.size();++i){ if(last[s.at(i)]

原创 把Json转Xml并且用xpath读取xml元素（JAVA）

maven<dependency> <groupId>net.sf.json-lib</groupId> <artifactId>json-lib</artifactId> <version>2.4</version> <classifier>jdk15</classifier> </dependency> <dependency> <