- 博客(85)
- 问答 (1)
- 收藏
- 关注
原创 CopyArrays
import java.util.Arrays;public class CopyArrays{ public static void main(String args[]) { int []a = {1, 2, 3, 4, 500, 600, 700, 800}; int [] b,c,d; System.out.println(Arrays.toString(a));
2020-03-18 14:32:18 321
原创 Mult
public class MULT{ public static void main(String args[]) { int k; for(int x=1;x<=9;x++) { for(int y=1;y<=x;y++) { k=y*x; System.out.print(y+"×"+x+"="+k+(k<10?" ":"\0")); }
2020-03-18 14:31:34 721
原创 约瑟夫问题 链表实现
list.h (链表函数接口)typedef struct node* link;struct node { int item; link next;};typedef link Node;void initNodes(int);void freeNode(link);link newNode(int);void insertNext(link,link);...
2019-08-16 11:12:26 401
原创 FIFO队列 ADT接口 链表实现
FIFO.h (接口)#include "Item.h"void QUEUinit(int);int QUEUempty(void);void QUEUput(Item);Item QUEUget(void);Item.h (自定义类型)typedef char Item;FIFO.c (接口实现)#include "FIFO.h"#include <s...
2019-08-16 11:10:36 164
原创 使用XPath查询XML文档简单用例
XML文档样本<?xml version="1.0" encoding="UTF-8"?><inventory> <book year="2000"> <title>Snow Crash</title> <author>Neal Stephenson</author> <publish...
2019-08-15 17:58:16 357
原创 FIFO队列 ADT接口 数组实现
FIFO.h (接口)#include "Item.h"#include <stdlib.h>typedef struct STACKnode *link;struct STACKnode{ Item item; link next;};void QUEUEinit(int);int QUEUEempty(void);void QUEUEput...
2019-08-14 14:15:56 183
原创 双端队列 ADT接口 数组实现
Deque ADT接口 DEQUEUE.h#include <stdlib.h>#include "Item.h"void DEQUEUEinit(int);void DEQUEUEerror(void);Item DEQUEUEheadget(void);Item DEQUEUEtailget(void);void DEQUEUEheadput(Item);vo...
2019-08-12 19:40:11 205
原创 双端队列 ADT接口 链表实现
Deque ADT接口 DEQUEUE.h#include <stdlib.h>#include "Item.h"typedef struct DEQUEUEnode *link;struct DEQUEUEnode{ Item item; link next; link last;};void DEQUEUEinit(int);void...
2019-08-12 19:35:34 209
原创 随机队列 ADT接口 数组实现
Random queue ADT接口 RANDOM.h#include <stdlib.h>#include "Item.h"#include <time.h>#include <stdbool.h>void RANDOMQUEUEtailput(int);void RANDOMQUEUEinit(int);bool RANDOMQUEUEi...
2019-08-12 19:31:12 180
原创 复数 一级ADT实现
COMPLEX.h/*typedef struct{ float RE; //实部 float IM; //虚部}Complex;*/typedef struct complex * Complex;Complex COMPLEXinit(float, float);float Re(Complex);float Im(Complex);Complex C...
2019-08-12 19:28:29 1064
原创 LIFO栈 ADT接口 数组实现
LIFO 栈结构typedef int ElemenType;struct seqStack{ ElemeType data[MaxSize]; int top; };typedef struct seqStack* Stack;LIFO 栈基本操作//LIFO 顺序栈 初始化void InitStack(Stack s){ ...
2019-08-12 19:23:39 135
原创 LIFO栈 ADT接口 链表实现
LIFO 链栈结构typedef int ElemType;struct node{ ElemType data; struct node* next; };typedef struct node* Stack;LIFO 链栈基本操作//LIFO 链栈初始化void InitStack(Stack top){ top = NULL;}//...
2019-08-12 19:20:16 126
原创 LIFO栈 ADT接口 实现十进制转其他进制
LIFO 接口 Stack.h//LIFO 链栈初始化void InitStack(Stack top){//LIFO 链栈判断栈空 boolean StackKEmpty(Stack top){//LIFO 链栈进栈 void Push(Stack top, ElemType x){//LIFO 链栈出栈 ElemType Pop(Stack top){//LIFO 链栈读...
2019-08-12 19:17:11 174
原创 IP组播 MulticastChannel接口 DatagramChannel实现
监听者import java.io.IOException;import java.net.InetAddress;import java.net.InetSocketAddress;import java.net.NetworkInterface;import java.net.StandardProtocolFamily;import java.net.StandardSock...
2019-08-12 19:13:11 546 1
原创 二叉树 ADT接口 遍历算法 常规运算
BTree.h (结构定义, 基本操作, 遍历)#define MS 10typedef struct BTreeNode{ char data; struct BTreeNode * left struct BTreeNode * right;}BTreeNode;BTreeN...
2019-08-12 19:08:42 437
原创 图 ADT接口 遍历运算 常规运算 邻接矩阵实现
Graph.h (图的结构, 遍历, 常规操作接口)/*定义图的最大定点数, 它要大于等于具体图的顶点树n*/#define MaxVertexNum 12/*定义图的最大边数,它要大于等于具体图的边数e*/#define MaxEdgeNum 20 /* 定义MaxValue 为一个符号常量,其值要大于邻接矩阵中所有有效值之和*/#define MaxValue 1000...
2019-08-12 19:04:43 335
原创 N个点中寻找多个最近两点的计算O(N²)
#include<math.h>#include<stdio.h>#include<stdlib.h>typedef struct point{ float x; float y;}point;float distance(point a,point b);float randFloat(void);int main(void){ ...
2018-03-05 17:06:07 407
原创 对字符串数组进行排序
#include<stdio.h>#include<stdlib.h>#include<string.h>#define Nmax 1000#define Mmax 10000char buf[Mmax]; int M=0;int compare(void *i, void *j);int main(void){ int N; ch...
2018-03-01 17:03:39 1625
原创 链表函数 (接口实现)范例
头文件(函数接口,链表类型定义)typedef struct node* link;struct node { int item; link next;};typedef link Node;void initNodes(int);void freeNode(link);link newNode(int);void insertNext(link,link);link d...
2018-02-28 13:25:56 312
原创 链表插入排序 链表指针实现
#include<stdlib.h>#include<stdio.h>typedef struct node* link; //链接struct node{ int item; link next; };//节点int main(void){ struct node heada, headb; link t, u, x, a=&he...
2018-02-14 17:56:36 293
原创 循环链表范例(约瑟夫问题) 数组实现
#include<stdio.h>#include<math.h>#include <stdlib.h>#define CALLOC(P, N, S)\ if(!((P)=calloc(N, S))){\ printf( stderr, "Insufficient memory");\ exit(EXIT_FAILURE);\ } in...
2018-02-14 10:59:36 442
原创 循环链表范例(约瑟夫问题)指针实现
#include<stdlib.h>#include<stdio.h>#include<math.h>typedef struct node* link; //链接struct node{ int item; link next; };//节点int main(void){ int N,M; printf("输入人数N\n...
2018-02-03 10:25:30 325
原创 抛硬币的模拟
#include#include#define CALLOC(P, N, S)\ if(!((P)=calloc(N, S))){\ printf( stderr, "Insufficient memory");\ exit(EXIT_FAILURE);\ }int heads(void); int main(void){ int *F; int N,M,cnt=
2018-02-01 14:06:57 1265
原创 埃拉托色尼筛算法查找素数(动态内存实现)
#include#include#define CALLOC(P, N, S)\ if(!((P)=calloc(N, S))){\ printf( stderr, "Insufficient memory");\ exit(EXIT_FAILURE);\ } int main(void){ int *a; int N; printf("输入素数范围:");
2018-02-01 12:19:50 241
原创 静态栈抽象数据类型stack实现
#include#include#include#define MAX_STACK_SIZE 10 //堆栈的最大大小typedef struct{ int key; //其他内容}Element;//模板类型void push( Element item, Element *stack, short *top);//向堆栈压入,入栈.成功返回1失败返回0Eleme
2018-01-26 21:54:56 298
原创 多项式_计算 动态内存存储
#include#include#include#include#define CALLOC(P, N, S)\ if(!((P)=calloc(N, S))){\ printf( stderr, "Insufficient memory");\ exit(EXIT_FAILURE);\ }#define REALLOC(P, S)\ if(!((P)=realloc(P
2018-01-09 16:01:17 323
原创 矩阵转置 动态内存实现
#include#include#define SWAP(X,Y,TEMP) ((TEMP)=(X),(X)=(Y),(Y)=(TEMP))#define MAX_SIZE 3#define CALLOC(P, N, S)\ if(!((P)=calloc(N, S))){\ printf(stderr, "Insufficient memory");\ exit(EXIT_
2018-01-03 09:52:48 520
原创 矩阵加法 时间性能测量
#include #include #define MAX_SIZE 100typedef struct { long repetitions; double duration;}times;void timer(void (*add)( int a[][MAX_SIZE], int b[][MAX_SIZE], int c[][MAX_SIZE], int n),
2018-01-01 17:09:32 337
原创 折半排序 循环&递归 时间性能测试
#include #include #define COMPARE(x, y) (((x) <(y)) ?-1:((x)==(y))? 0:1)#define MAX_SIZE 1000000typedef struct { double duration; long repetitions;}times;int binsearch_f(int list[],int sear
2018-01-01 15:36:25 349
原创 数组求和(递归和循环)函数 时间性能测量(最差情形)
#include #include #define MAX_SIZE 1000typedef struct { double duration; long repetitions;}times;double sum_f(double list[], int n);double sum_r(double list[], int n);void timer(double(*
2017-12-31 22:12:25 374
原创 矩阵转置函数时间性能测量(最差情形)
#include#include#define MAX_SIZE 100#define SWAP(x, y, t) ((t)=(x), (x)=(y),(y)=t)void transpose(int a[][MAX_SIZE],int n);int main(void){ int step=10; double duration; clock_t start; lon
2017-12-31 22:09:22 302
原创 冒泡排序时间性能测量(最差情形)
#include<stdio.h>#include<time.h>#define MAX_SIZE 1001#define SWAP(x,y,t) ((t)=(x),(x)=(y),(y)=t)void sort(int [], int);int main(void){ int step=10; int a[MAX_SIZE]; double dur...
2017-12-31 22:05:26 482
原创 计算矩阵转置函数的步总数公式
#includeint count=0;#define MAX_SIZE 2#define SWAP(x, y, t) ((t)=(x), (x)=(y),(y)=t)void transpose(int a[][MAX_SIZE]);int main(void){ int a [MAX_SIZE][MAX_SIZE]={{1,2},
2017-12-30 11:36:42 559
原创 计算矩阵点乘函数步总数的公式
#includeint count=0;#define MAX_SIZE 2void dot_p(int a[][MAX_SIZE], int b[][MAX_SIZE], int c[][MAX_SIZE], int rows, int cols);int main(void){ int a[MAX_SIZE][MAX_SIZE]={{9,8},{2,3}}; i
2017-12-30 11:31:44 2104
原创 计算矩阵乘法函数步总数的公式
#includeint count=0;#define MAX_SIZE 2void mult(int a[][MAX_SIZE], int b[][MAX_SIZE], int c[][MAX_SIZE], int rows, int cols);int main(void){ int a[MAX_SIZE][MAX_SIZE]={{9,8},{2,3}}; in
2017-12-30 11:26:29 411
原创 计算打印矩阵的函数步总数公式
#includeint count=0;#define MAX_SIZE 2void printf_(int a[][MAX_SIZE], int rows, int cols);int main(void){ int a[MAX_SIZE][MAX_SIZE]={{2,3},{4,5}}; printf_(a, MAX_SIZE,MAX_SIZE); prin
2017-12-30 11:17:29 232
原创 Hanoi塔
#include <stdio.h>#define Tower1 1#define Tower2 2#define Tower3 3void towers_of_hanoi(int, int, int, int);int main(){ int n_disks; printf("Number of disks: "); scanf("%d", &n_dis...
2017-12-30 10:57:58 179
原创 计算二项式系数使用循环和递归实现
#include <stdio.h>double recurBinom(int, int);double iterBinom(int, int);double recurFact(int n);int main(){ int n,m; printf("n:(>=0): "); scanf("%d", &n); while (n <...
2017-12-30 10:56:01 976
原创 Fibonacci使用递归和循环实现
#includedouble Fibonacci(int i);double Fibonacci_(int i);int main(void){ int i; printf("Enter the number i:\n"); scanf("%d", &i); printf("%f %f",Fibonacci(i),Fibonacci_(i));
2017-12-30 10:54:21 395
原创 按升序打印X,Y,Z的整数值
#include #define TRUE 1#define FALSE 0int main(){ int x,y,z; printf("x: "); scanf("%d", &x); printf("y: "); scanf ("%d", &y); printf("z: "); scanf("%d", &z); if ((x<y)&&(y<z)) { p
2017-12-30 10:40:36 298
空空如也
MSSQL 2017 数据库 字体 设置
2017-12-07
TA创建的收藏夹 TA关注的收藏夹
TA关注的人