Given an integer, the task is to generate a Java Program to Increment by 1 All the Digits of a given Integer.
Examples:
Input: 12345 Output: 23456 Input: 110102 Output: 221213
Approach 1:
In this approach, we will create a number which will be of the same length as the input and will contain only 1 in it. Then we will add them.
- Take the integer input.
- Find its length and then generate the number containing only 1 as digit of the length.
- Add both numbers.
- Print the result.
Java
// Java Program to Increment by 1 All the Digits of a given // Integer // Importing Libraries import java.util.*; import java.io.*; class GFG { // Main function public static void main(String[] args) { // Declaring the number int number = 110102 ; // Converting the number to String String string_num = Integer.toString(number); // Finding the length of the number int len = string_num.length(); // Declaring the empty string String add = "" ; // Generating the addition string for ( int i = 0 ; i < len; i++) { add = add.concat( "1" ); } // COnverting it to Integer int str_num = Integer.parseInt(add); // Adding them and displaying the result System.out.println(number + str_num); } } |
221213
Approach 2:
In this approach, we will take an integer variable with value 1, we will multiply that variable with 10 and keep on adding the variable to the number till both of them have the same length.
- Take the integer input.
- Add value 1 to the input.
- Multiply 1 with 10 and again add them.
- Keep on repeating step 2 and 3 till both of them have the same length.
- Print the result.
Java
// Java Program to Increment by 1 All the Digits of a given // Integer // Importing Libraries import java.util.*; import java.io.*; class GFG { // Main function public static void main(String[] args) { // Declaring the number int number = 110102 ; // Declaring another variable with value 1 int add = 1 ; for ( int i = 0 ; i < String.valueOf(number).length(); i++) { // Adding variable add and number number = number + add; // Multiplying value of the add with 10 add = add * 10 ; } // Printing result System.out.println(number); } } |
221213
Time Complexity: O(l) where l is the length of an integer.
Space Complexity: O(1)
Attention reader! Don’t stop learning now. Get hold of all the important Java Foundation and Collections concepts with the Fundamentals of Java and Java Collections Course at a student-friendly price and become industry ready.