 # Java Exercises: Compute the digit number of sum of two given integers

## Java Basic: Exercise-212 with Solution

Write a Java program to compute the digit number of sum of two given integers.

Input:

Each test case consists of two non-negative integers a and b which are separated by a space in a line. 0 ≤ a, b ≤ 1,000,000

Pictorial Presentation: Sample Solution:

Java Code:

``````import java.util.*;
public class Main
{
public static void main(String[] args)
{
System.out.println("Input two integers(a b):");
Scanner stdIn = new Scanner(System.in);
int a = stdIn.nextInt();
int b = stdIn.nextInt();
int sum = a + b;
int count = 0;
while(sum != 0)
{
sum /= 10;
++count;
}
System.out.println("Digit number of sum of said two integers:");
System.out.println(count);
}
}
```
```

Sample Output:

```Input two integers(a b):
13 25
Digit number of sum of said two integers:
2
```

Flowchart: Java Code Editor:

What is the difficulty level of this exercise?

﻿

## Java: Tips of the Day

Array vs ArrayLists:

The main difference between these two is that an Array is of fixed size so once you have created an Array you cannot change it but the ArrayList is not of fixed size. You can create instances of ArrayLists without specifying its size. So if you create such instances of an ArrayList without specifying its size Java will create an instance of an ArrayList of default size.

Once an ArrayList is full it re-sizes itself. In fact, an ArrayList is internally supported by an array. So when an ArrayList is resized it will slow down its performance a bit as the contents of the old Array must be copied to a new Array.

At the same time, it's compulsory to specify the size of an Array directly or indirectly while creating it. And also Arrays can store both primitives and objects while ArrayLists only can store objects.

Ref: https://bit.ly/3o8L2KH