leetcode/3783/main.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14

#include <stdlib.h>

int reverse(int n) {
	int rev = 0;
	while (n != 0) {
		rev = rev * 10 + n % 10;
		n /= 10;
	}
	return rev;
}

int mirrorDistance(int n) {
	return	abs(n - reverse(n));   
}