64,636
社区成员
发帖
与我相关
我的任务
分享
```
void CreateListR(ListNode* &L, int a[], int n)
{
L = (ListNode *)malloc(sizeof(ListNode));
L->next = nullptr; //建立空表
ListNode *s;
ListNode *r; //指向尾端结点
r = L;
for (int i = 0; i < n; i++)
{
s = (ListNode *)malloc(sizeof(ListNode));
s->data = a[i];
r->next = s;
r = s;
}
r->next = nullptr; //最后将r->next置为nullptr
}
```
```
int a[5] = {1,2,3,4,3};
ListNode *L;
CreateListR(L, a, 5);
```
```
int ListLength(ListNode* L)
{
int length = 0;
ListNode *p = L;
while (p->next != nullptr)
{
length++;
p = p->next;
}
return length;
}
```