GCD and LCM of two numbers in Java

Following is an example which computes find LCM and GCD of two given numbers.

Program

import java.util.Scanner;
public class LCM_GCD {
   public static void lcm(int a, int b){
      int max, step, lcm = 0;
      if(a > b){
         max = step = a;
      } else{
         max = step = b;
      }
      while(a!= 0) {
         if(max%a == 0 && max%b == 0) {
            lcm = max;
            break;
         }
         max += step;
      }
      System.out.println("LCM of given numbers is :: "+lcm);
   }
   public static void gcd(int a,int b){
      int i, hcf = 0;
         for(i = 1; i <= a || i <= b; i++) {
            if( a%i == 0 && b%i == 0 )
            hcf = i;
         }
         System.out.println("gcd of given two numbers is ::"+hcf);
   }
   public static void main(String args[]){
      Scanner sc = new Scanner(System.in);
      System.out.println("Enter first number ::");
      int a = sc.nextInt();
      System.out.println("Enter second number ::");
      int b = sc.nextInt();
      lcm(a, b);
      gcd(a,b);
   }
}

Output

Enter first number ::
125
Enter second number ::
25
LCM of given numbers is :: 125
GCD of given two numbers is ::25