class Solution {
public int minSwapsCouples(int[] row) {
int ans=0;
for(int i=0;i<row.length;i+=2){
int second=(row[i]%2==0?row[i]+1:row[i]-1);//first,second
if(row[i+1]==second) continue;
for(int j=i+2;j<row.length;j++){
if(row[j]==second){
row[j]=row[i+1];
row[i]=second;
ans++;
break;
}
}
}
return ans;
}
}
LeetCode 765. Couples Holding Hands
最新推荐文章于 2021-10-17 19:57:31 发布