- 博客(19)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 C4.5
http://blog.csdn.net/xuxurui007/article/details/18045943C4.5对ID3算法有一下4点改进：1）用信息增益率来选择属性，克服了洗没洗增益选择属性时偏向选择去之多的属性的不足；2）在树构造过程中进行剪枝；3）能够完成对连续属性的离散化处理；4）能够对不完整数据进行处理；http://www.cnblogs.com
2015-03-19 21:42:06
666
原创 Find Peak Element
https://leetcode.com/problems/find-peak-element/public class Solution { public int findPeakElement(int[] num) { int c1 = num[0]; int c2 = num[1]; if(c1 > c2){
2015-03-17 10:49:24
368
原创 Unique Paths
https://leetcode.com/problems/unique-paths/public class Solution { public int uniquePaths(int m, int n) { int[][] a = new int[m][n]; int i, j; for(i = 0; i < m
2015-03-16 20:17:14
343
原创 Find Minimum in Rotated Sorted Array
https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/public class Solution { public int findMin(int[] num) { int i, count = num[0], count1, min = num[0]; for(
2015-03-16 19:34:49
352
原创 Binary Tree Level Order Traversal II
貌似快速AC一道题的效果还不如怎么都AC不了呢https://leetcode.com/problems/binary-tree-level-order-traversal-ii//** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; *
2015-03-16 13:02:25
352
转载 pat1051
http://www.2cto.com/kf/201311/254409.html模拟栈入栈出栈顺序，分析清楚即可！！！#include #include using namespace std; int _tmain(int argc, _TCHAR* argv[]) { int M; //maximum capacity of the sta
2015-03-10 18:49:13
383
转载 pat1050
http://www.cnblogs.com/michaeljunlove/p/3885267.html#include#include#includeusing namespace std;#define N 128int main(){ int i=0,sum; bool is_exist[N]; char ch; char str
2015-03-10 18:38:15
526
转载 pat1049
http://blog.csdn.net/makecontral/article/details/38538357 这么神奇的规律，真心看不出来啊T_T#includeint CountOnes(int n){ int count = 0; int factor = 1; int higher,lower,cur; while(n/factor != 0){ hig
2015-03-10 18:30:14
746
转载 pat1048
http://blog.csdn.net/realxuejin/article/details/10362221#include#includeusing namespace std;#define max 100000int input[max];int main(){ int N,M; cin>>N>>M; int i,j; int temp; int f
2015-03-10 16:56:05
552
转载 pat1047
http://blog.csdn.net/matrix5467/article/details/8647960C++ vector begin().end()//1047 19:20-19：38#include#include#include#include#includeusing namespace std;map >m;bool cmp(const str
2015-03-10 16:31:36
484
转载 pat1046
http://blog.csdn.net/tiantangrenjian/article/details/13769011#include #include using namespace std;ifstream fin("in.txt");#define cin finint main(){ int n; cin>>n; int* dis = ne
2015-03-10 16:31:25
422
转载 pat1045
http://blog.csdn.net/tiantangrenjian/article/details/19921051最长公共子序列！！！题意：题目抽象出来就是寻找两个序列的最长公共子序列, 但是公共部分允许元素重复出。分析：是最长公共子序列（LCS，Longest Common Subsequence）的变种-公共部分可以元素重复。#i
2015-03-10 16:15:07
430
转载 pat1033
map容器的用法！！！http://blog.csdn.net/matrix5467/article/details/8641186#include#include#include#include#includeusing namespace std;map > adj;//邻接表map weight;//各点权重map visit;//是否访问过map ans;/
2015-03-09 14:44:47
452
原创 pat1028
C++超时，C 73ms过了，看来还是用C刷题的好#include#include#includetypedef struct{ char id[10]; char name[10]; int score;}student;student s[100001];int N;int cmp1(const void *p, const void *q){ student s
2015-03-09 12:59:48
424
原创 pat1061
捣鼓了一天VS，终于写出了一道题T_T#include#include#includeusing namespace std;string week[] = {"MON","TUE","WED","THU","FRI","SAT","SUN"};int main(){ //freopen("C://Users//Yuanyin//Desktop//in.txt","r",st
2015-03-04 17:29:55
432
原创 pat1013
真真地见识到不同算法的性能了，牛x!!!本来用java dfs，内存超限！！用java union-find，还是内存超限！！！用C++普通的union-find,超时！！！用quick-union，还是超时！！！用加权的quick-union才完全通过！！！而且前几个测试用例用70+ms直接降到了1ms#include#includeusing namespace std;#
2015-03-02 20:35:55
564
原创 pat1041
#includeusing namespace std;int main(){ int N, i; int MAX = 10010; cin>>N; int count[MAX]; int a[N]; for( i = 0 ; i < N; i++){ cin>>a[i]; count[a[i]]++; } for(i = 0; i < N; i++){ if(
2015-03-02 15:08:00
479
原创 pat1012
c++还真的比java要效率，一下午两道题java都超时，c++竟然AC了#include#includeusing namespace std;int main(){ int NN, MM, i, j; cin>>NN>>MM; string idStrings[NN],idString; int C[NN], M[NN], E[NN], A[NN], rank[4
2015-03-02 15:06:46
671
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人