8. Integer Decomposition

Give you an integer n, Split it into all its smallest factors （ Greater than 1） Multiplicative form of , At the same time, abide by the principle of minimum factor first , The small factor is in front , Such as n=6, The output 2*3=6.

package com;

import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;

public class Main {
    public static void main(String[] args){
        Scanner s = new Scanner(System.in);
        while (s.hasNextInt()){
            System.out.println(mul(s.nextInt()));
        }
    }

    public static String mul(int num){
        StringBuilder sb = new StringBuilder();
        String number = String.valueOf(num);
        List<Integer> list = new LinkedList<Integer>();
        for(int i=2;i<=num;i++){
            while(num%i==0){
                num/=i;
                list.add(i);
            }
        }
        for(int i=0;i<list.size();i++){
            if(i==(list.size()-1)){
                sb.append(list.get(i));
            }else{
                sb.append(list.get(i));
                sb.append("*");
            }
        }
        sb.append("=");
        sb.append(number);
        return sb.toString();
    }
}

Such as ：

Input ：
5
6
24
Output ：
5=5
2*3=6
2*2*2*3=24