当前位置：首页 > news >正文

快速生成力扣链表题的链表，实现快速调试

news 2025/8/22 2:57:43

关于力扣链表题需要本地调试创建链表的情况

我们在练习链表题，力扣官方需要会员，我们又不想开会员，想在本地调试给你们提供的代码
声明：本人也是参考的别人的代码，给你们提供不同语言生成链表
参考链接：参考链接

1、编写代码：

C++版本

#include<iostream>struct ListNode {int val;ListNode* next;ListNode(int value) : val(value), next(nullptr) {}
};ListNode* createSList(int* nums, int sz) {ListNode* head = nullptr;ListNode* tail = nullptr;for (int i = 0; i < sz; ++i) {ListNode* newNode = new ListNode(nums[i]);if (tail == nullptr) {head = tail = newNode;} else {tail->next = newNode;tail = newNode;}}return head;
}void destroySList(ListNode* head) {while (head != nullptr) {ListNode* temp = head;head = head->next;delete temp;}
}int main() {int arr[] = {1, 2, 3, 4, 5, 6};int sz = sizeof(arr) / sizeof(arr[0]);ListNode* plist = createSList(arr, sz);// 在程序结束前释放链表占用的内存destroySList(plist);return 0;
}

JAVA版本

public class ListNode {int val;ListNode next;ListNode(int value) {val = value;next = null;}
}public class Main {static ListNode createSList(int[] nums) {ListNode head = null;ListNode tail = null;for (int num : nums) {ListNode newNode = new ListNode(num);if (tail == null) {head = tail = newNode;} else {tail.next = newNode;tail = newNode;}}return head;}static void destroySList(ListNode head) {while (head != null) {ListNode temp = head;head = head.next;temp = null;}}public static void main(String[] args) {int[] arr = {1, 2, 3, 4, 5, 6};ListNode plist = createSList(arr);// 在程序结束前释放链表占用的内存destroySList(plist);}
}

Python版本

class ListNode:def __init__(self, value):self.val = valueself.next = Nonedef create_slist(nums):head = Nonetail = Nonefor num in nums:new_node = ListNode(num)if tail is None:head = tail = new_nodeelse:tail.next = new_nodetail = new_nodereturn headdef destroy_slist(head):while head is not None:temp = headhead = head.nexttemp = Nonearr = [1, 2, 3, 4, 5, 6]
plist = create_slist(arr)# 在程序结束前释放链表占用的内存
destroy_slist(plist)