三元组操作与比较-CSDN博客

本文链接：https://blog.csdn.net/lzdelphi/article/details/104117486

#include <stdio.h>
#include <stdlib.h>

#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2

typedef int Status;
typedef int ElemType;
typedef ElemType* Triplet;

Status InitTriplet(Triplet *T,ElemType v1,ElemType v2,ElemType v3){
    *T=(ElemType *)malloc(3*sizeof(ElemType));
    if(!(*T))exit(OVERFLOW);
    ElemType *e=*T;
    e[0]=v1;e[1]=v2;e[2]=v3;
    return OK;
}

Status DestroyTriplet(Triplet T){
    free(T);
    T = NULL;
    return OK;
}

Status Get(Triplet T,int i,ElemType *e){
    if(i<1 || 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;
}

Status IsAscending(Triplet T){
    return (T[0]<=T[1]) && (T[1]<=T[2]);
}

Status IsDecending(Triplet T){
    return (T[0]>=T[1]) && (T[1]>=T[2]);
}

Status Max(Triplet T,ElemType *e){
    *e=(T[0]>=T[1])?(T[0]>=T[2]?T[0]:T[2])
                   :(T[1]>=T[2]?T[1]:T[2]);
    return OK;
}

Status Min(Triplet T,ElemType *e){
    *e=(T[0]<=T[1])?(T[0]<=T[2]?T[0]:T[2])
                   :(T[1]<=T[2]?T[1]:T[2]);
    return OK;
}

int main()
{
    Triplet *T;
    InitTriplet(&T,5,2,3);
    printf("%d,%d,%d\n",T[0],T[1],T[2]);
    if(IsAscending(T)) printf("IsAscending\n");
    if(IsDecending(T)) printf("IsDecending\n");

    ElemType *e;
    Put(T,3,4);
    Get(T,3,&e);
    printf("%d\n",e);

    DestroyTriplet(T);

    return 0;
}