- 博客(8)
- 收藏
- 关注
RSS订阅原创 删除字符串中重复元素
#includeint main(){ char str[10]; printf("str:"); scanf("%s",str); int len=0,i=0; while(str[i]!='\0') { len++;//统计长度 i++; } // prin
2015-12-02 16:41:12
440
原创 数据结构之图_Graph_List
#ifndef GRAPH_LIST_H_INCLUDED#define GRAPH_LIST_H_INCLUDED#include#include#includeusing std::cout;using std::cin;using std::endl;struct Edge{ friend class Graph_List; Edge(in
2015-11-23 20:00:42
661
原创 数据结构之树_Tree
#ifndef TREE_H_INCLUDED#define TREE_H_INCLUDED#include#include #includetemplate class TreeNode//树的节点{private: T data; TreeNode *firstChild, *nextBrother;//左孩子和右兄弟public: TreeNo
2015-11-23 19:59:11
307
1
原创 数据结构之二叉树_BinTree
#ifndef BINTREE_H_INCLUDED#define BINTREE_H_INCLUDED#include#include using std::cin;using std::cout;using std::endl;templateclass BinTreeNode//二叉树的节点声明{private: BinTreeNode*
2015-11-23 19:57:35
565
1
原创 数据结构之栈_Stack
#ifndef STACK_H_INCLUDED#define STACK_H_INCLUDED#includetemplate struct Node{ T data; Node* next; Node(const T& item, Node* nxt = NULL) :data(item), next(nxt){}};template c
2015-11-23 19:54:29
192
原创 数据结构之队列_Queue
#ifndef QUEUE_H_INCLUDED#define QUEUE_H_INCLUDED#includetemplate struct Node{ T data; Node* next; Node(const T& item, Node* nxt = NULL) :data(item), next(nxt){}};template
2015-11-23 19:51:50
229
原创 数据结构之链表_list
#ifndef LIST_H_INCLUDED#define LIST_H_INCLUDED#includetemplate struct Node{ T data; Node* next; Node(const T& item, Node* nxt=NULL) :data(item), next(nxt){}};template c
2015-11-23 19:48:51
180
原创 关机小程序
#include#include#include#include void output(){printf(" ********************************\n");printf(" * 关机小程序 *\n");printf(" * *\n"
2015-11-09 20:52:27
296
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人