카타 8급 Closest elevator

1 개요

카타 8급 C

#	🔗	문제	풀이

2 C++

char* elevator(int left, int right, int call) {
  int L = left-call;
  int R = right-call;
  if( L < 0 ) L = -L;
  if( R < 0 ) R = -R;
  if( L < R ) return "left";
  return "right";
}

#include <math.h>
char* elevator(int left, int right, int call) {
  return (abs(call-left) < abs(call-right)) ? "left" : "right";
}

3 Python

def elevator(left, right, call):
    if abs(left-call)<abs(right-call):
        return "left";
    return "right";