Moving Stones Until Consecutive LeetCode solution in C++

1
class Solution {
2
 public:
3
  vector<int> numMovesStones(int a, int b, int c) {
4
    vector<int> arr = {a, b, c};
5

6
    sort(arr.begin(), arr.end());
7

8
    // find minimum moves
9

10
    int mini = 0;
11

12
    if (arr[1] - arr[0] == 1 && arr[2] - arr[1] == 1) {
13
      mini = 0;
14
    } else if (arr[1] - arr[0] <= 2 || arr[2] - arr[1] <= 2) {
15
      mini = 1;
16
    } else {
17
      mini = 2;
18
    }
19

20
    // find maximum moves
21

22
    int maxi = (arr[1] - arr[0] - 1) + (arr[2] - arr[1] - 1);
23

24
    return {mini, maxi};
25
  }
26
};