leetcode

Leetcode Solutions (0x6A73)
git clone https://git.pngu.org/leetcode
Log | Files | Refs | Submodules | README

mirror_dist_int.c (760B)

 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
// 3783. Mirror Distance of an Integer
#include "leetcode.h"

/*
 * you are given an integer 'n'. define its mirror distance as 'abs(n -
 * reverse(n))' where 'reverse(n)' is the integer formed by reversing the digits
 * of 'n'. return an integer denoting the mirror distance of 'n'. 'abs(x)'
 * denotes the absolute value of 'x'.
 */

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

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

int main() {
  int r1 = mirrorDistance(25);
  int r2 = mirrorDistance(10);
  int r3 = mirrorDistance(7);
  printf("%d\n", r1);
  assert(r1 == 27);
  printf("%d\n", r2);
  assert(r2 == 9);
  printf("%d\n", r3);
  assert(r3 == 0);
}