#include using namespace std; struct LinkNode { int val; LinkNode *next; LinkNode(int val, LinkNode *next = nullptr) { this->val = val; this->next = next; } }; LinkNode *create(int intarr[], int length, int num) { LinkNode *node = nullptr; if (num < length) { node = new LinkNode(intarr[num]); node->next = create(intarr, length, num + 1); } return node; } void display(LinkNode *node) { while (node) { cout << node->val << " "; node = node->next; } cout << endl; } LinkNode *sort_digui(LinkNode *head1, LinkNode *head2) { LinkNode *node = nullptr; if (head1 && head2) { if (head1->val > head2->val) { node = head2; node->next = sort_digui(head1, head2->next); } else { node = head1; node->next = sort_digui(head1->next, head2); } } else if (head1) { node = head1; } else if (head2) { node = head2; } return node; } void test(char ch[100]) { cout << "strlen " << strlen(ch) << endl;//计算字符串长度截止到‘\0’,不包含’\0’。 cout << "sizeof " << sizeof(ch) << endl;//在这里ch退化为指针 } int main() { int intarr[5] = { 10,20,30,50,80 }; int intarr1[5] = { 11,25,34,45,78 }; LinkNode *head1 = create(intarr, 3, 0); LinkNode *head2 = create(intarr1, 5, 0); display(head1); display(head2); LinkNode *head3 = sort_digui(head1, head2); display(head3); cout << “-------------------” << endl; test(“123456789”); system(“pause”); return 0; }
