首页 > TAG信息列表 > leetcode1033
leetcode1033-移动石子直到连续
移动石子直到连续 分类讨论 class Solution { public int[] numMovesStones(int a, int b, int c) { if(a > b){int t = a; a = b; b = t;} if(a > c){int t = a; a = c; c = t;} if(b > c){int t = b; b = c; c = t;} int num1 = b-a-1,