数据结构triplet
来源:互联网 发布:淘宝全棉时代有假货吗 编辑:程序博客网 时间:2024/05/01 05:11
#include"stdafx.h"
#include<iostream>
using namespace std;
#include<iostream>
using namespace std;
//抽象数据类型Triplet的表示和实现
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
typedef int Status;
typedef struct ElemType
{
int data;
}*Triplet ;
typedef struct ElemType
{
int data;
}*Triplet ;
Status InitTriplet(Triplet& T, ElemType v1, ElemType v2, ElemType v3);
Status DestroyTriplet(Triplet &T);
Status Get(Triplet T, int i, ElemType &e);
Status Put(Triplet &T, int i, ElemType e);
Status IsAscending(Triplet T);
Status IsDescending(Triplet T);
Status Max(Triplet T, ElemType &e);
Status Min(Triplet T, ElemType &e);
Status DestroyTriplet(Triplet &T);
Status Get(Triplet T, int i, ElemType &e);
Status Put(Triplet &T, int i, ElemType e);
Status IsAscending(Triplet T);
Status IsDescending(Triplet T);
Status Max(Triplet T, ElemType &e);
Status Min(Triplet T, ElemType &e);
void main()
{
Triplet testT;
ElemType e1, e2, e3;
e1.data = 1, e2.data = 2, e3.data = 3;
InitTriplet(testT, e1, e2, e3);
cout << e1.data << "haaaaaa" << testT[1].data;
Put(testT, 1, e3);
cout << "\n" << testT[0].data << "hahhah";
system("pause");
}
{
Triplet testT;
ElemType e1, e2, e3;
e1.data = 1, e2.data = 2, e3.data = 3;
InitTriplet(testT, e1, e2, e3);
cout << e1.data << "haaaaaa" << testT[1].data;
Put(testT, 1, e3);
cout << "\n" << testT[0].data << "hahhah";
system("pause");
}
Status InitTriplet(Triplet& T, ElemType v1, ElemType v2, ElemType v3)
{
T = (ElemType*)malloc(3 * sizeof(ElemType));
if (!T) exit(OVERFLOW);
T[0] = v1;
T[1] = v2;
T[2] = v3;
}
{
T = (ElemType*)malloc(3 * sizeof(ElemType));
if (!T) exit(OVERFLOW);
T[0] = v1;
T[1] = v2;
T[2] = v3;
}
Status DestroyTriplet(Triplet &T)
{
free(T);
return OK;
}
{
free(T);
return OK;
}
Status Get(Triplet T, int i, ElemType &e)
{
if (1 < i || i > 3)return ERROR;
e = T[i - 1];
return OK;
}
{
if (1 < i || i > 3)return ERROR;
e = T[i - 1];
return OK;
}
Status Put(Triplet &T, int i, ElemType e)
{
if (i < 1 || i>3)return ERROR;
T[i - 1] = e;
return OK;
}
{
if (i < 1 || i>3)return ERROR;
T[i - 1] = e;
return OK;
}
Status IsAscending(Triplet T)
{
return(T[0].data <= T[1].data && T[1].data <= T[2].data);
}
Status IsDescending(Triplet T)
{
return(T[0].data >= T[1].data&&T[1].data >= T[2].data);
}
{
return(T[0].data <= T[1].data && T[1].data <= T[2].data);
}
Status IsDescending(Triplet T)
{
return(T[0].data >= T[1].data&&T[1].data >= T[2].data);
}
Status Max(Triplet T, ElemType &e)
{
int temp = (T[0].data >= T[1].data) ? (T[0].data >= T[2].data ? 0 : 2) : (T[1].data >= T[2].data ? 1 : 2);
e = T[temp];
return OK;
}
{
int temp = (T[0].data >= T[1].data) ? (T[0].data >= T[2].data ? 0 : 2) : (T[1].data >= T[2].data ? 1 : 2);
e = T[temp];
return OK;
}
Status Min(Triplet T, ElemType &e)
{
int temp = (T[0].data <= T[1].data) ? (T[0].data <= T[2].data ? 0 : 2) : (T[1].data<= T[2].data ? 1 : 2);
e = T[temp];
return OK;
}
{
int temp = (T[0].data <= T[1].data) ? (T[0].data <= T[2].data ? 0 : 2) : (T[1].data<= T[2].data ? 1 : 2);
e = T[temp];
return OK;
}
0 0
- 数据结构triplet
- PHP 数据结构 算法 三元组 Triplet
- 数据结构C语言实现——ADT Triplet
- 三元组Triplet的Java实现(数据结构 例1-6)
- 数据结构(严蔚敏)抽象数据类型Triplet的表示与实现(第一章)
- 数据结构学习足迹:绪论Triplet碰到的问题及分析解答
- Triplet Loss
- Triplet较完整版
- 334. Increasing Triplet Subsequence
- leetcode Increasing Triplet Subsequence
- LeetCode - Increasing Triplet Subsequence
- [LeetCode] Increasing Triplet Subsequence
- Increasing Triplet Subsequence
- LeetCode Increasing Triplet Subsequence
- Leetcode:Increasing Triplet Subsequence
- 334. Increasing Triplet Subsequence
- Increasing Triplet Subsequence
- LeetCode:Increasing Triplet Subsequence
- ASP.NET MVC 4 RC的JS/CSS打包压缩功能
- 解决自然数幂和的方法
- 使用python的PIL库简单的处理图像
- 事务——锁定一行
- matlab中 mcc、mbuild和mex命令详解
- 数据结构triplet
- 最少知识原则
- zoj3869 Ace of Aces && zoj3880 Demacia of the Ancients(水)
- 在IIS上启用Gzip压缩(HTTP压缩)
- leetcode:Same Tree 【Java】
- Doxygen初学与简单应用
- Sqlist
- iis配置php环境
- HTTP协议详解(转)