Skip to main content

How to write a program in Java by taking user input using user controlled loop?

Java program for taking user input using Scanner and Store into Variables and Array 

Java program for taking user input using Scanner and store into variable and array

When you start learning Java programming, many times you need to get input from user and store into some variables or array.

We can use Scanner class that presents in "java.util.Scanner" for taking user inputs.

We can not store String value to int or any other data type value to other one, so Scanner class have particular methods for getting specific user input.

Scanner class have many methods for taking user input i.e, 

  • For taking int value = nextInt()
  • For taking String value = next()
  • For taking Float value = nextFloat()

You can see all methods on Java doc :

Program 1 : Getting User Input using Scanner Class

import java.util.Scanner;

public class ScannerDemo {

    public static void main(String[] args) {       
       
        // Creating Scanner class object and initialize it
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter String :");
       
        // Getting String user input and store into s variable
        String s = sc.next();
               
        // Print user input
        System.out.println("String value is : "+ s);

    }

}

Output :

Enter String :
Java Programming Scanner Class Demo

String value is : Java Programming Scanner Class Demo

Program 2 : Storing Array values from User input using Scanner Class

import java.util.Scanner;

public class FindTheMedian {

    public static void main(String[] args) {
        
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter Array Length : ");
        int length = sc.nextInt();

        // Creating and Initializing Array with User input length
        int[] array = new int[length];
       
        // Traverse through 0 to length and enter user input into Array
        System.out.println("Enter Elements : ");
        for (int i = 0; i < length; i++) {
            array[i] = sc.nextInt();
        }
       
        // Print Array Elements one by one
        System.out.println("Printing Array Elements : ");
        for (int i = 0; i < length; i++) {
            System.out.print(array[i] +" ");   
        }

    }

Output :

Enter Array Length :
5

Enter Elements :
10 5 15 20 2

Printing Array Elements :
10 5 15 20 2

We can also add user input data into Array list same as above we put in array.

RECOMMENDED ARTICLES :

Comments

Popular posts from this blog

Sales by Match HackerRank Solution | Java Solution

HackerRank Sales by Match problem solution in Java   Problem Description : Alex works at a clothing store. There is a large pile of socks that must be paired by color for sale. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. For example, there are n=7 socks with colors socks = [1,2,1,2,1,3,2]. There is one pair of color 1 and one of color 2 . There are three odd socks left, one of each color. The number of pairs is 2 .   Example 1 : Input : n = 6 arr = [1, 2, 3, 4, 5, 6] Output : 0 Explanation : We have 6 socks with all different colors, So print 0. Example 2 : Input : n = 10 arr = [1, 2, 3, 4, 1, 4, 2, 7, 9, 9] Output : 4 Explanation : We have 10 socks. There is pair of color 1, 2, 4 and 9, So print 4. This problem easily solved by HashMap . Store all pair of socks one by one in Map and check if any pair is present in Map or not. If pair is present then increment ans variable by 1 ...

Queen's Attack II HackerRank Solution in Java with Explanation

Queen's Attack II Problem's Solution in Java (Chessboard Problem)   Problem Description : You will be given a square chess board with one queen and a number of obstacles placed on it. Determine how many squares the queen can attack.  A queen is standing on an n * n chessboard. The chess board's rows are numbered from 1 to n, going from bottom to top. Its columns are numbered from 1 to n, going from left to right. Each square is referenced by a tuple, (r, c), describing the row r and column c, where the square is located. The queen is standing at position (r_q, c_q). In a single move, queen can attack any square in any of the eight directions The queen can move: Horizontally (left, right) Vertically (up, down) Diagonally (four directions: up-left, up-right, down-left, down-right) The queen can move any number of squares in any of these directions, but it cannot move through obstacles. Input Format : n : The size of the chessboard ( n x n ). k : The number of obstacles...