typedef int ElemType;
typedef int Status;
typedef struct {
ElemType data[maxsize];
int length;
} SqList;
void CreateList(SqList * L, ElemType a[], int n)
{ //dingyi
if (n > maxsize || n < 1) {
printf("輸入不合法\n");
return;
}
for (int i = 0; i < n; i++)
L->data[i] = a[i];
L->length = n;
debug("L->length=%d", L->length);
}
int Empty(SqList * L)
{
if (L->length == 0)
return 1;
else
return 0;
}
void printout(SqList * L)
{
int i;
debug("L->length=%d", L->length);
if (Empty(L)) {
printf("空表");
return;
}
for (i = 0; i < L->length; i++)
printf("%d ", L->data[i]);
}
int main()
{
int i, n;
ElemType a[maxsize];
SqList *L, c;
L = &c;
L = (SqList *) malloc(sizeof(SqList));
printf("鏈表長度和各資料:\n");
scanf("%d", &n);
debug("n=%d", n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
debug("a[%d]=%d", i, a[i]);
}
CreateList(L, a, n);
printout(L);
}
uj5u.com熱心網友回復:
#include<stdio.h>
#include<stdlib.h>
#define maxsize 100
typedef int ElemType;
typedef int Status;
typedef struct{
ElemType data[maxsize];
int length;
} SqList;
typedef int ElemType;
typedef int Status;
typedef struct {
ElemType data[maxsize];
int length;
} SqList;
void CreateList(SqList * L, ElemType a[], int n)
{ //dingyi
if (n > maxsize || n < 1) {
printf("輸入不合法\n");
return;
}
for (int i = 0; i < n; i++)
L->data[i] = a[i];
L->length = n;
debug("L->length=%d", L->length);
}
int Empty(SqList * L)
{
if (L->length == 0)
return 1;
else
return 0;
}
void printout(SqList * L)
{
int i;
debug("L->length=%d", L->length);
if (Empty(L)) {
printf("空表");
return;
}
for (i = 0; i < L->length; i++)
printf("%d ", L->data[i]);
}
int main()
{
int i, n;
ElemType a[maxsize];
SqList *L, c;
L = &c;
L = (SqList *) malloc(sizeof(SqList));
printf("鏈表長度和各資料:\n");
scanf("%d", &n);
debug("n=%d", n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
debug("a[%d]=%d", i, a[i]);
}
CreateList(L, a, n);
printout(L);
}
SqList *L, c;
L = &c;
L = (SqList *) malloc(sizeof(SqList));
typedef int ElemType;
typedef int Status;
typedef struct {
ElemType data[maxsize];
int length;
} SqList;
void CreateList(SqList * L, ElemType a[], int n)
{ //dingyi
if (n > maxsize || n < 1) {
printf("輸入不合法\n");
return;
}
for (int i = 0; i < n; i++)
L->data[i] = a[i];
L->length = n;
debug("L->length=%d", L->length);
}
int Empty(SqList * L)
{
if (L->length == 0)
return 1;
else
return 0;
}
void printout(SqList * L)
{
int i;
debug("L->length=%d", L->length);
if (Empty(L)) {
printf("空表");
return;
}
for (i = 0; i < L->length; i++)
printf("%d ", L->data[i]);
}
int main()
{
int i, n;
ElemType a[maxsize];
SqList *L, c;
L = &c;
L = (SqList *) malloc(sizeof(SqList));
printf("鏈表長度和各資料:\n");
scanf("%d", &n);
debug("n=%d", n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
debug("a[%d]=%d", i, a[i]);
}
CreateList(L, a, n);
printout(L);
}
SqList *L, c;
L = &c;
L = (SqList *) malloc(sizeof(SqList));
眾所周知,C ++的學習曲線陡峭,但是花時間學習這種語言將為您的職業帶來奇跡,并使您與其他開發人員區分開。您會更輕松地學習新語言,形成真正的解決問題的技能,并在編程的基礎上打下堅實的基礎。 C ++將幫助您養成良好的編程習慣(即清晰一致的編碼風格,在撰寫代碼時注釋代碼,并限制類內部的可見性),并且由 ......
值傳遞不會改變本身,參考傳遞(如果傳遞的值需要實體化到堆里)如果發生修改了會改變本身。 1.基本資料型別都是值傳遞 package com.example.basic; public class Test { public static void main(String[] args) { int ......