- 博客(17)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 SQL Server2008学习笔记1
SELECT FAge, COUNT(*) as '数目' FROM T_EmployeeGROUP BY FAge;--SELECT FAge, COUNT(*) FROM T_Employee--GROUP BY FAge;faultSELECT FAge, MAX(FSalary) as salary,COUNT(*) as number FROM T_EmployeeGROU
2011-11-28 11:21:15
674
原创 c#学习笔记
*属性： 属性开头字母大写属性可以判断输入的非法值属性本身不存储值->依靠字段*索引器using System;using System.Collections.Generic;using System.Linq;using System.Text;namespace b{ class Program { static v
2011-11-25 21:03:07
330
原创 实用链表(待续)
#include #include typedef struct node{ struct node *next; int data;}node,*link,*position;typedef struct linklist{ link head, tail; int len;}linklist;void MakeNode(link *p,int e){ *p =
2011-11-19 17:14:53
354
原创 带头结点的双向循环链表
#include #include typedef struct node{ int data; struct node*next, *prior;}node,*link;void ListIni(link *list){ *list = (link)malloc(sizeof(node)); if(*list) { exit(-1); } (*list)->da
2011-11-18 16:25:34
1170
原创 带尾节点的循环链表基本操作
#include #include typedef struct node{ int data; struct node *next;}node,*link;void ListIni(link *list){ *list = (link)malloc(sizeof(node)); if(!(*list)) { exit(-1); } (*list)->data =
2011-11-18 14:43:30
1089
原创 带头结点的链表
#include #include #include "4.h"/*typedef struct node{ int data; struct node *next;}node,*link;*/void ListIni(link *list){ *list = (link)malloc(sizeof(node)); if(!(*list))
2011-11-15 16:41:08
347
原创 带头结点的循环链表基本操作
#include #include typedef struct node{ int data; struct node * next;}Node,*link;void InitList(link * list){ (*list) = (link)malloc(sizeof(Node)); if(!(*list)) { exit(-1); } (*list)->d
2011-11-14 15:50:16
518
转载 动态语言
<br />源地址：<br />http://www.3snews.net/html/58/6358-8173.html<br /> <br />通常我们所说的动态语言、静态语言指 动态类型语言（Dynamically Typed Language）和 静态类型语言Statically Typed Language）。<br />还有一个 Dynamic Programming Language （动态编程语言），静态编程语言。<br /><br /> 动态类型语言：在运行期间检查数据的类型的语言。用
2011-02-25 12:44:00
643
转载 Programmer Competency Matrix
Programmer Competency MatrixNote that the knowledge for each level is cumulative; being at level n implies that you also know everything from the levels lower than n.Computer Science 2n (Level 0)n2 (Level 1)n (Level 2)log(n) (Level 3)Commentsdata structure
2010-12-04 16:06:00
388
转载 Programmer Competency Matrix
<br />Programmer Competency MatrixNote that the knowledge for each level is cumulative; being at level n implies that you also know everything from the levels lower than n.Computer Science 2n (Level 0)n2 (Level 1)n (Level 2)log(n) (Level 3)Commentsdata str
2010-12-04 16:06:00
448
转载 dijkstra最短路径算法C实现
//path记录上一个节点# include # include # define maxlen 10# define large 999typedef struct{ int vexnum; char vexs[maxlen]; int arcs[maxlen][maxlen];}graph;void init_graph(graph *g){ int i = 0,j = 0; g -> vexnum = 5; for(i = 0; i for(j =
2010-11-09 12:20:00
601
原创 递归逆序数组元素
#include #include void reverseArray(int array[], int number);void swap(int* x, int* y);int a[5] = {0,1,2,3,4};int main(){ reverseArray(a, 5); int count; for(count = 0; count
2010-10-14 14:30:00
1027
原创 两种方法寻找一个集合的所有子集
<br />#include <iostream>using namespace std;const int n = 4;int x[n];char str[n][50] = {'id','name','sex','age'};//回溯法void backtrack(int t){ if(t >= n) { for(int i = 0; i < n; i++) cout<<x[i]; cou
2010-10-14 00:19:00
804
原创 寻找主键小程序
<br />#include <iostream>#include <fstream>using namespace std;ofstream outfile("C://Users//yanfeng//Desktop//1.txt");int num = 6;int const numTable = 2;//表的个数int const numCol = 6;//表的列数int const numRow = 6;//表的行数int keyArray[numCol
2010-10-14 00:17:00
437
转载 参加ACM比赛所需的基础知识(转)
http://www.yuanma.org/data/2007/0612/article_2663.htm一、语言是最重要的基本功 <br /> <br /> 无论侧重于什么方面，只要是通过计算机程序去最终实现的竞赛，语言都是大家要 <br /> 过的第一道关。亚洲赛区的比赛支持的语言包括C/C++与JAVA。笔者首先说说JAVA，众所周知，作为面向对象的王牌语言，JAVA在大型工程的组织与安全性方面有着自己独特的优势，但是对于信息学比赛的具体场合，JAVA则显得不那么合适
2010-10-12 16:13:00
904
转载 &操作符常见用法
<br />一种是按位与 1 & 2 = 0<br />一种是取地址int* p = &a;<br />一种是声明引用，相当于定义变量别名：<br /><br />int a = 3;<br />int& b = a; // b是a的引用，a，b是同一个变量<br />b = 4; // a也变化为4<br />int c = 2;<br />b = c; // 是赋值给b或a，而不是把b作为c的引用，引用一旦被声明，引用对象不可更改<br /><br />引用的实质是指针的简化运用版，上面的代码等价为：<
2010-10-10 15:54:00
432
转载 C++中的向量学习
<br />#include <iostream><br />#include <vector>//要包含这个头文件<br />usingnamespace std;<br /><br />int main(void)<br />{<br /><br /> vector<int> a(10);//定义了10个整数元素的向量，但没有给出初值，因而，其值是不确定滴。<br /> vector<int> b(10,1);//定义了10个证书元素的向量，且给出每个元素的初值为1<br /> vec
2010-10-10 12:49:00
978
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人