您好,登錄后才能下訂單哦!
輸入一個(gè)連表的頭結(jié)點(diǎn),從尾到頭反過(guò)來(lái)打印出每個(gè)結(jié)點(diǎn)的值。
C#語(yǔ)言實(shí)現(xiàn):
public static void PrintRev(LinkedList<int> lList) { Stack<int> stack = new Stack<int>(); foreach (int item in lList) { stack.Push(item); } while (stack.Count > 0) { Console.WriteLine(stack.Pop()); } }
Java語(yǔ)言實(shí)現(xiàn):
private static void printRev(LinkedList<Integer> lLink) { Stack<Integer> stack = new Stack<Integer>(); Iterator<Integer> it = lLink.iterator(); while(it.hasNext()){ stack.push(it.next()); } while (!stack.isEmpty()) { System.out.println(stack.pop()); } }
Python語(yǔ)言實(shí)現(xiàn):
class Node(object): """ 單鏈表節(jié)點(diǎn) """ def __init__(self, data=None, next=None): self.data = data self.next = next class LinkedList(object): def __init__(self, node=None): self.node = node def print_link_rev(self): """ 逆序打印鏈表 :return: """ lst = [] node = self.node while node: lst.append(node.data) node = node.next for data in sorted(lst, reverse=True): print(data)
免責(zé)聲明:本站發(fā)布的內(nèi)容(圖片、視頻和文字)以原創(chuàng)、轉(zhuǎn)載和分享為主,文章觀點(diǎn)不代表本網(wǎng)站立場(chǎng),如果涉及侵權(quán)請(qǐng)聯(lián)系站長(zhǎng)郵箱:is@yisu.com進(jìn)行舉報(bào),并提供相關(guān)證據(jù),一經(jīng)查實(shí),將立刻刪除涉嫌侵權(quán)內(nèi)容。