Skip to main content

Adding one to number represented as Linked List


In this post, we will discuss a method to add one to a number which is represented using nodes of the linked list. 
This problem becomes very simple if the given linked list is considered to be doubly linked list as it is easier to add one to the number at the end of the linked list and traverse the list from backward direction till carry becomes zero. but if the given linked list is a singly linked list then we have to first reverse the given linked list and then add one to the first node. So considering our linked list is a simple linked list we follow the below steps.

Algorithm:

  1. Reverse the linked list.
  2. Add one to the data field of the first node. 
  3. While carry is not zero keep adding carry to the next node's data field 
  4. if you reach the end of the linked list and the carry is not zero then we add a new node to the end of the linked list. 
  5. Reverse the final linked list and return the head node of the linked list.


Adding one to a number represented as Linked List image

C++ Program

Sample input and output to check the program



Comments

Popular posts from this blog

Infix to Prefix conversion using Stack

This post is about conversion of Infix expression to Prefix conversion. For this conversion we take help of stack data structure, we need to push and pop the operators in and out of the stack.

Infix expressions are the expressions that we normally use,eg. 5+6-7; a+b*c etc. Prefix expressions are the expressions in which the 2 operands are preceded by the operator eg. -+567 , +a*bc etc.

This method is very similar to the method that we used to convert Infix to Postfix but the only difference is that here we need to reverse the input string before conversion and then reverse the final output string before displaying it.

NOTE: This changes one thing that is instead of encountering the opening bracket we now first encounter the closing bracket and we make changes accordingly in our code.

So, to convert an infix expression to a prefix expression we follow the below steps
(we have 2 string, 1st is the input infix expression string 2nd is the output string which is empty initially)


We first revers…

Hashing with Quadratic Probing

Hashing is a technique used for storing , searching and removing elements in almost constant time. Hashing is done with help of a hash function that generates index for a given input, then this index can be used to search the elements, store an element, or remove that element from that index.

A hash function is a function that is used to map the data elements to their position in the data structure used. For example if we use an array to store the integer elements then the hash function will generate position for each element so that searching, storing and removing operation on the array can be done in constant time that is independent of the number of elements in the array. For better look at the example below.



now we face a problem if for 2 numbers same position is generated example consider elements 1 and 14

1 % 13 = 1

14 % 13 = 1

so when we get 1 we store it at the first position, but when we get 14 we see that the position 1 is already taken, this is a case of collision.

Inorder…

Home Page