[자바/파이썬 알고리즘] 근삿값 알고리즘

TIP

 

차이값의 절대값의 최소값 알고리즘을 적용해주면 된다.

차이값의 절대값을 담아줄 min 변수와

결과가 담길 near 변수가 필요하다는 것이 중요 포인트인 알고리즘!

 

 

 

자바

 

import java.util.Arrays;

public class App {
    public static void main(String[] args) throws Exception {
        //[1] Initialize
        int min = Integer.MAX_VALUE;
        //[2] Input
        int [] numbers = {23,56,65,2,2,3,3};
        int target = 25;
        int near = 0;
        //[3] Process : MAX
        for(int x : numbers) {
            if(Math.abs(target - x) < min){
                min = target - x;
                near = x;
            }
        }
        //[4] Output
        System.out.println(near); //23
    }
}

 

파이썬

numbers = [23,56,65,2,2,3,3]
min = numbers[0]
target = 25;
near = 0
for x in range(len(numbers)):
    if abs(target - numbers[x]) < min :
        min = target - numbers[x]
        near = numbers[x] 
print(near)

 

abs로 직접 구현하면 아래와 같다.

public class App {
    public static int abs(int x){
        return x > 0 ? x: x*-1;
    }
    public static void main(String[] args) throws Exception {
        //[1] Initialize
        int min = Integer.MAX_VALUE;
        //[2] Input
        int [] numbers = {23,56,65,2,2,3,3};
        int target = 25;
        int near = 0;
        //[3] Process : MAX
        for(int x : numbers) {
            if(min > abs(target - x)) {
                min = abs(target - x);
                near = x;
            }
        }
        //[4] Output
        System.out.println(near); //23
    }
}

파이썬

numbers = [23,56,65,24,2,3,3]
def userAbs(a):
	if a > 0 :
		return a
	return -a

min = numbers[0]
target = 25;
near = 0
for x in range(len(numbers)):
    if userAbs(target - numbers[x]) < min :
        min = target - numbers[x]
        near = numbers[x] 
print(near)