Skip to content
This repository has been archived by the owner on Oct 14, 2021. It is now read-only.

Added Reverse a doubly linked list (Python) #283 #288

Merged
merged 6 commits into from
Oct 28, 2020
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@

# Program to find the number of occurrence of each unique word in the sequence of occurrence of each word.

from collections import Counter

if __name__ == '__main__':
n = int(input())
w = []
for i in range(n):
x = input()
w.append(x)
c = Counter(w)
l = len(c)
print(l)
v = c.values()
for i in v:
print(i, end=' ')
Original file line number Diff line number Diff line change
@@ -0,0 +1,72 @@
#!/bin/python3

# Program to inplement reversal of a Doubly LinkedList.

import math
import os
import random
import re
import sys

class DoublyLinkedListNode:
def __init__(self, node_data):
self.data = node_data
self.next = None
self.prev = None

class DoublyLinkedList:
def __init__(self):
self.head = None
self.tail = None

def insert_node(self, node_data):
node = DoublyLinkedListNode(node_data)

if not self.head:
self.head = node
else:
self.tail.next = node
node.prev = self.tail


self.tail = node

def print_doubly_linked_list(node, sep):
while node:
print(str(node.data), end=' ')
node = node.next


# DoublyLinkedListNode:
# int data
# DoublyLinkedListNode next
# DoublyLinkedListNode prev

def reverse(head):
r = head
p = None
while r!=None:
q = r.next
r.next = p
r.prev = q
p = r
r = q
return p


if __name__ == '__main__':
t = int(input())

for t_itr in range(t):
llist_count = int(input())

llist = DoublyLinkedList()

for _ in range(llist_count):
llist_item = int(input())
llist.insert_node(llist_item)

llist1 = reverse(llist.head)

print_doubly_linked_list(llist1, ' ')