Search - FIRST FOLLOW S

Search - FIRST FOLLOW S - List

[Program doc] tongxunlu DL : 0: 数据结构构建通讯录 printf( \t 1.创建通讯录链表\n ) printf( \t 2.将姓名为Name的好友的手机号改为MTel\n ) printf( \t 3.输出通讯录\n ) printf( \t 4.将通讯录按照好友姓名进行非递减排序\n ) printf( \t 5.将两个按姓名非递减排序的通讯录合并为一个，姓名相同且手机号相同的好友记录在结果中只保留一个\n ) printf( \t 6.统计籍贯是大连的好友人数\n ) printf( \t 7.将通讯录中倒数第k个结点之后的所有结点移到头结点后面（保持结点间的先后顺序）\n ) printf( \t 8.将通讯录的正中间位置结点之后的全部结点倒置\n ) -Data Structure Construction Contacts printf (" \ t 1. Create contacts list \ n" ) printf (" \ t 2. Name of the friend' s name is changed phone number MTel \ n" ) printf (" \ t 3. Output contacts \ n " ) printf (" \ t 4. The contacts follow friend' s name non-descending order \ n " ) printf (" \ t 5. The two non-descending order by name contacts merged into one, the same name and the phone number is the same record-keeping only one friend \ n in the result " ) printf (" \ t 6. Statistical native of Dalian' s friend number \ n " ) printf (" \ t 7. All contacts in the penultimate node k nodes after the first node is moved back point (keep the order between nodes) \ n " ) printf (" \ t 8. The middle position node address book After all nodes inverted \ n " )
Date : 2025-12-20 Size : 399kb User : 张三