AlgorithmsInJava/src/Miscellaneous/P3_ClosestMultiple.java at master · LavishSwarnkar/AlgorithmsInJava · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
package Miscellaneous;

public class P3_ClosestMultiple {

    public static void main(String args[]){
        System.out.println(getClosestMultiple2(-16, 6));

        System.out.println(getClosestMultiple(5, 2));
        System.out.println(getClosestMultiple(13, 6));
        System.out.println(getClosestMultiple(15, 6));
        System.out.println(getClosestMultiple(18, -7));
        /* Output :
            6
            12
            18
            21
         */

        System.out.println(getClosestMultiple(5, 2));
        System.out.println(getClosestMultiple(-13, 6));
        System.out.println(getClosestMultiple(-15, 6));
        System.out.println(getClosestMultiple(-16, 6));
        /* Output :
            6
            -12
            -18
            -18
         */

        System.out.println(getClosestMultiple(5, 2));
        System.out.println(getClosestMultiple(-13, -6));
        System.out.println(getClosestMultiple(-15, -6));
        System.out.println(getClosestMultiple(-16, -6));
        /* Output :
            6
            -12
            -18
            -18
         */
    }

    private static int getClosestMultiple(int n, int m){
        int rem = n % m;
        if(rem < 0)
            return n - (Math.abs(rem) >= Math.abs(m)/2 ? Math.abs(m) - Math.abs(rem) : rem);
        return rem == 0 ? n : n + (rem >= Math.abs(m)/2 ? Math.abs(m)-rem : -rem);
    }

    private static int getClosestMultiple2(int n, int m){
        return (int) (m * Math.round(((double)n/Math.abs(m))));
    }

}