#!/usr/bin/env python #coding = utf-8 class Node: def __init__(self,data=None,next = None): self.data = data self.next = next def rev(link): pre = link cur = link.next pre.next = None while cur: temp = cu
#!/usr/bin/env python #coding = utf-8 class Node: def __init__(self,data=None,next = None): self.data = data self.next = next def rev(link): pre = link cur = link.next pre.next = None while cur: temp = cur.next cur.next = pre pre =cur cur = temp retu
定义链表结构: class ListNode: def __init__(self, x): self.val = x self.next = None 输出该链表l1的元素: while l1: print(l1.val) l1 = l1.next 将一个list的数据存为链表: def list2listnode(num): head = ListNode(num[0]) result = head for i in range(1,len(num)): head.next = ListNo
#include <stdio.h>#include <stdlib.h>#define NN 12#define MM 20typedef int elemType ;/*******************************************************//* 以下是关于线性表链接存储(单链表)操作的16种算法 *//***************************************************