Day 15: Linked List

Myth丶恋晨 2022-03-06 12:58 127阅读 0赞

# 题目： #

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3podWlxaXV6aHVveXVlNTgz_size_16_color_FFFFFF_t_70][]

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3podWlxaXV6aHVveXVlNTgz_size_16_color_FFFFFF_t_70 1][]

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3podWlxaXV6aHVveXVlNTgz_size_16_color_FFFFFF_t_70 2][]

# C++： #

#include <stdlib.h>
    #include <stdio.h>
    #include <algorithm>
    #include <vector>
    #include <map>
    #include <math.h>
    #include <string>
    #include <iostream>
    
    using namespace std;
    
    class Node
    {
    public:
        int data;
        Node *next;
        Node(int d) {
    	data = d;
    	next = NULL;
        }
    };
    class Solution {
    public:
    
        Node* insert(Node *head, int data)
        {
    	//Complete this method        //注意这里head为NULL的判断
    	if (head == NULL) {
    	    head = new Node(data);
    	}
    	else if (head->next==NULL) {
    	    head->next = new Node(data);
    	}
    	else {
    	    insert(head->next,data);     //使用递归
    	}
    	return head;
        }
    
        void display(Node *head)
        {
    	Node *start = head;
    	while (start)
    	{
    	    cout << start->data << " ";
    	    start = start->next;
    	}
        }
    };
    int main()
    {
        Node* head = NULL;
        Solution mylist;
        int T, data;
        cin >> T;
        while (T-- > 0) {
            cin >> data;
    	head = mylist.insert(head, data);
        }
        mylist.display(head);
    
        system("pause");
        return 0;
    }

# python： #

class Node:
        def __init__(self,data):
            self.data = data
            self.next = None
    class Solution:
        def display(self,head):
            current = head
            while current:
                print(current.data,end=' ')
                current = current.next
    
        def insert(self,head,data):                      //注意这里head为NULL的判断
        #Complete this method
            if head==None:
                head=Node(data)
            elif head.next==None:
                head.next = Node(data)
            else:
                self.insert( head.next, data)            //使用递归
            return head
    
    
    mylist= Solution()
    T=int(input())
    head=None
    for i in range(T):
        data=int(input())
        head=mylist.insert(head,data)
    mylist.display(head);

# 总结： #

## C++： ##

这里链表的插入使用，递归实现，注意对head节点，判断其是否为空。

## python： ##

这里链表的插入使用，递归实现，注意对head节点，判断其是否为空。

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3podWlxaXV6aHVveXVlNTgz_size_16_color_FFFFFF_t_70]: /images/20220303/71c93de657424ed08917d3286b467f7f.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3podWlxaXV6aHVveXVlNTgz_size_16_color_FFFFFF_t_70 1]: /images/20220303/afce6f96ee194b009c7a532e00255030.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3podWlxaXV6aHVveXVlNTgz_size_16_color_FFFFFF_t_70 2]: /images/20220303/18bec4844c044ddb980a27e6988982e0.png