- 博客(10)
- 资源 (1)
- 收藏
- 关注
转载 OAuth2.0认证
OAuth2.0认证http://www.cnblogs.com/blowing00/p/4521135.html http://www.barretlee.com/blog/2016/01/10/oauth2-introduce/
2017-09-30 00:08:26 161
原创 链表的基本操作C/c++
#include #include #include using namespace std;struct ListNode{int data;ListNode* next;};typedef ListNode List;struct dListNode{int data;dListNode* next;dListNode* previous;};typedef dListNode dList;/
2016-07-04 18:19:15 364
原创 邻接表图的建立与BFS、DFS
头文件与结构体 #include #include #include using namespace std; bool visited[30]; struct EdgeNode{ int dest; int weight; EdgeNode* link; }; struct VertexNode{ char data; EdgeNode* first; }; struct A
2016-06-16 09:42:12 601
原创 哈夫曼树基本操作
结构体定义: typedef struct node{ int data; int l, r, p; }HuffmanTree;1、HufmanTree的建立 void createHuffmanTree(HuffmanTree*& H, int * inArr, int len){ int i, j, min1, min2; H = (HuffmanTree*)malloc((2 *
2016-06-14 18:27:37 648
原创 网易实习,任意n个数组合求最大
#include #include #include using namespace std;typedef unsigned long long int ulli;struct val_info{ulli value;int place;};bool greatermark(const val_info& s1,const val_info& s2) //使用sort算法将val_info以va
2016-03-24 10:07:02 496
原创 c++ primer plus 习题6.3(switch)
#include using namespace std; int main(){ cout<<"please enter one of the following choices:\n"; cout<<"c) carrnivore"<<"\t"<<"p) pinist\n"; cout<<"t) tree"<<"\t"<<"g) game\n"; char choice; cin>>c
2015-01-15 21:47:16 359
原创 c++ primer plus 习题5.8(5.9)(while(cin>>word),strcmp())
#include #include // prototype for strcmp() const int STR_LIM = 50; int main() { using namespace std; char word[STR_LIM]; int count = 0; cout << "Enter words (to stop, type
2015-01-15 20:15:34 383
原创 c++ primer plus 习题6.1 (cctype,cin.get)
#include #include using namespace std; int main() { char ch,change; cout<<"please input:"; cin.get(ch); while(ch != '@'){ if(!isdigit(ch)){ if(isupper(ch)) { change=ch+32; cout<<c
2015-01-15 20:11:04 271
原创 c++ primer plus 习题5.7(使用new为结构创建动态数组)
#include using namespace std; struct car{ string brand; int year; }; int main(){ int num,i; cout cin>>num; car *pz= new car[num] ; for(i=1;i cout cout cin>>pz[i-1].brand; cout cin>>pz[
2015-01-14 13:24:25 392
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人