Question

Python Expert, I need your help:

I need to write a function(rev_int_rec) that take an integet number(num = 1234567) and retrive the last digit using (lastDigit = num % 10) and add it to a queue.

Remove each last digit from num using the % operator

Add each last digit to the queue, with each round of recursion reduce num by dividing by 10. Base case is when num is less than 10
# Base case: If num < 10
# Enqueue last digit and return

--------------------Queue()-----------------

class _QueueNode:

def __init__(self, item):

self.item = item
self.next = None

class Queue:

def __init__(self):

self._qhead = None

self._qtail = None
self._size = 0

def is_empty(self): 

return self._size == 0

def __len__(self):

return self._size

def enqueue(self, item):

node = _QueueNode(item)
if self.is_empty():
    self._qhead = node
else:
    self._qtail.next = node

self._qtail = node
self._size += 1

def dequeue(self):

node = self._qhead
if self._qhead is self._qtail:
    self._qtail = None
self._qhead = self._qhead.next
self._size -= 1
return node.item

For example:

lastDigit2 = number % 10

number = number // 10

lastDigit1 = number % 10

number = number // 10

lastDigit0 = number % 10

number = number // 10

reversed_number = lastDigit2 * Math.pow (10, 2) + lastDigit1 * Math.pow (10, 1) + lastDigit0 * Math.pow (10, 0);

reversed_number: 321

Answer 1

class _QueueNode:

def __init__(self, item):

self.item = item

self.next = None

class Queue:

def __init__(self):

self._qhead = None

self._qtail = None

self._size = 0

def is_empty(self):

return self._size == 0

def __len__(self):

return self._size

def enqueue(self, item):

node = _QueueNode(item)

if self.is_empty():

self._qhead = node

else:

self._qtail.next = node

self._qtail = node

self._size += 1

def dequeue(self):

node = self._qhead

if self._qhead is self._qtail:

self._qtail = None

self._qhead = self._qhead.next

self._size -= 1

return node.item

#method to reverse the number using queue

def reverse(n):

q = Queue()

m=n

while(0<n):#while n is not empty

lastdigit = n%int(10)

#pushing it to queue

q.enqueue(lastdigit)

n=int(n/int(10))

s=0#reversing

while(0<m):

l = q.dequeue()

s=s*int(10) + int(l)

m=int(m/int(10))

return s

s = int(input("Enter number:"))

print("Reversed_number:",reverse(s))

output:

Enter number:123   

Reversed_number: 321   

  

  

...Program finished with exit code 0   

Press ENTER to exit console.   

//PLS give a thumbs up if you find this helpful, its helps me alot, thanks.