Eip_Nit_AC 2019-06-26 10:46 采纳率: 25%
浏览 1921
已结题

数据结构的疑问:不存在从 "int" 转换到 "People" 的适当构造函数?

#include<stdio.h>
#include<iostream>
#define MaxWindow 30
#define MaxProc 1
#define error 0
using namespace std;
typedef struct People ElementType;

struct People
{
    int T;
    int P;
};

typedef int Position;
struct QNode 
{
    ElementType *Data;
    Position Front, Rear;
    int MaxSize;
};
typedef struct QNode *Queue;

Queue CreatQueue(int MaxSize)
{
    Queue Q = (Queue)malloc(sizeof(struct QNode));
    Q->Data = (ElementType *)malloc(MaxSize * sizeof(ElementType));
    Q->Front = Q->Rear = 0;
    Q->MaxSize = MaxSize;
    return Q;
}

bool IsFull(Queue Q)
{
    return((Q->Rear + 1) % Q->MaxSize == Q->Front);
}

bool AddQ(Queue Q, ElementType X)
{
    if (IsFull(Q))
    {
        printf("队列满\n");
        return false;
    }
    else
    {
        Q->Rear = (Q->Rear + 1) % Q->MaxSize;
        Q->Data[Q->Rear] = X;
        return true;
    }
}

bool IsEmpty(Queue Q)
{
    return(Q->Front == Q->Rear);
}

ElementType DeleteQ(Queue Q)
{
    if (IsEmpty(Q))
    {
        printf("队列空\n");
        return 0;
    }
else
    {
        Q->Front = (Q->Front + 1) % Q->MaxSize;
        return Q->Data[Q->Front];
    }
}

void DestroyQueue(Queue Q)
{
    free(Q);
}

double QueueingAtBank(Queue Q, int N)
{
    struct People Next;
    int k;
    int TotalTime;
    int CurrentTime;
    int Window[MaxWindow];
    int WaitTime;
    int WinAvail;
    int i, j;
    scanf("%d", &k);

    for (i = 0; i < k; i++)
        Window[i] = 0;
    TotalTime = 0;

    while (!IsEmpty)
    {
        WinAvail = FindNextWindow(Window, k, &WaitTime);
        CurrentTime += WaitTime;
        Next = DeleteQ(Q);
        if (CurrentTime >= Next.T)
            TotalTime += (CurrentTime - Next.T);
        else
        {
            WaitTime = Next.T - CurrentTime;
            for (j = 0; j < k; j++)
            {
                Window[j] -= WaitTime;
                if (Window[j] < 0)
                    Window[j] = 0;
            }
            CurrentTime = Next.T;
        }
        Window[WinAvail] = Next.P;
    }
    return((double)TotalTime / (double)N);
}

int FindNextWindow(int W[], int k, int *WaitTime)
{
    int WinAvail;
    int MinW = MaxProc + 1;
    int i;
    for (i = 0; i < k; i++)
        if (W[i] < MinW)
        {
            MinW = W[i];
            WinAvail = i;
        }
    *WaitTime = MinW;
    for (i = 0; i < k; i++)
        W[i] -= MinW;
    return WinAvail;
}

int main()
{
    int N;
    Queue Q;
    int i;
    ElementType X;
    scanf("%d", &N);
    Q = CreatQueue(N);
    for (i = 0; i < N; i++)
    {
        scanf("%d %d", &X.T, &X.P);
        AddQ(Q, X);
    }
    printf("Average waiting time = %.lf minute(s).\n", QueueingAtBank(Q, N));

    DestroyQueue(Q);
    return 0;
}
1   IntelliSense:  不存在从 "int" 转换到 "People" 的适当构造函数

请问各位大佬我这串代码的报错是为什么呀

  • 写回答

1条回答 默认 最新

  • 我叫侯万楼 2019-06-26 19:47
    关注

    图片说明
    建议编译一下代码

    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论

报告相同问题?

问题事件

  • 已结题 (查看结题原因) 4月10日

悬赏问题

  • ¥15 Stata 面板数据模型选择
  • ¥20 idea运行测试代码报错问题
  • ¥15 网络监控:网络故障告警通知
  • ¥15 django项目运行报编码错误
  • ¥15 请问这个是什么意思?
  • ¥15 STM32驱动继电器
  • ¥15 Windows server update services
  • ¥15 关于#c语言#的问题:我现在在做一个墨水屏设计,2.9英寸的小屏怎么换4.2英寸大屏
  • ¥15 模糊pid与pid仿真结果几乎一样
  • ¥15 java的GUI的运用