Skip to main content

Convert 24 to 12 Hour and 12 to 24 Hour Time in Java

Time Conversion in Java

Convert 24 to 12 Hour and 12 to 24 Hour Time in Java

In Java, we can easily convert time from 12 to 24 hour and 24 to 12 hour. 

12 hour time 12:00:00 becomes 00:00:00 in 24 hour time. 

Lets jump on code.

Example 1 : Convert 12 Hour to 24 Hour time in Java

import java.text.DateFormat;
import java.text.ParseException;
import java.text.SimpleDateFormat;
import java.util.Date;

public class TimeConversion {

    public static void main(String[] args) {
       
        String s1 = "12:01:00 AM";
        String s2 = "05:30:00 PM";
       
        DateFormat dateFormat = new SimpleDateFormat("hh:mm:ss aa");
        DateFormat outputformat = new SimpleDateFormat("HH:mm:ss");
        try {
            Date date1 = dateFormat.parse(s1);
            Date date2 = dateFormat.parse(s2);
            System.out.println(outputformat.format(date1));
            System.out.println(outputformat.format(date2));
        } catch (ParseException e) {
            e.printStackTrace();
        }
    }

}

Output :

00:01:00
17:30:00

Code Explanation :

We have taken two String time 12 AM and 5:30 PM. First we parse the String time to Date using DateFormat class.

We have to convert 12 to 24 hour time, so another format is set as "HH:mm:ss". 

small hh means 12 hour and capital HH means 24 hour.

Parse the String date to date using DateFormat class reference and store into Date class. Last, print both date to 24 hour format using format() method.

Example 2 : Convert 24 Hour to 12 Hour time in Java

import java.text.DateFormat;
import java.text.ParseException;
import java.text.SimpleDateFormat;
import java.util.Date;

public class TimeConversion {

    public static void main(String[] args) {
        
        String s1 = "00:00:00";
        String s2 = "17:30:00";
        
        DateFormat dateFormat = new SimpleDateFormat("HH:mm:ss");
        DateFormat outputformat = new SimpleDateFormat("hh:mm:ss aa");
        try {
            Date date1 = dateFormat.parse(s1);
            Date date2 = dateFormat.parse(s2);
            
            System.out.println(outputformat.format(date1));
            System.out.println(outputformat.format(date2));
        } catch (ParseException e) {
            e.printStackTrace();
        }
    }

}

Output :

12:00:00 am
05:30:00 pm

 

 

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...