c++ simple ordereing the min calculation
\nAs a convenience to calculate the max move - we can "order" the stones in a 3-array using intializer list.\nFor minimum, the answer can only be zero, one or t
\nAs a convenience to calculate the max move - we can "order" the stones in a 3-array using intializer list.\nFor minimum, the answer can only be zero, one or two; so using a min of a min operation;  since any gap of more than one, is the same case as a gap of one.\n```\n\n    vector<int> numMovesStones(int a, int b, int c) {\n        array<int, 3> stones = {a, b, c};\n        sort(begin(stones), end(stones));\n        \n        const int d1 = stones[1] - stones[0] - 1;\n        const int d2 = stones[2] - stones[1] - 1;\n        const auto total_d = d1 + d2;\n        \n        int mini; \n        if (!d1 && !d2) mini = 0;\n        else if (!d1 || !d2) mini = 1;\n        else mini = min (2, min (d1, d2));\n        \n        return {mini, total_d};\n\n    }\n
['C']