1 Star 2 Fork 5

LilithSangreal/LeetCode-Solutions

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
moving-stones-until-consecutive.cpp 1.04 KB
一键复制 编辑 原始数据 按行查看 历史
// Time: O(1)
// Space: O(1)
class Solution {
public:
vector<int> numMovesStones(int a, int b, int c) {
vector<int> s = {a, b, c};
sort(s.begin(), s.end());
if (s[0] + 1 == s[1] && s[1] + 1 == s[2]) {
return {0, 0};
}
return {(s[0] + 2 >= s[1] || s[1] + 2 >= s[2]) ? 1 : 2,
s[2] - s[0] - 2};
}
};
// Time: O(1)
// Space: O(1)
class Solution2 {
public:
vector<int> numMovesStones(int a, int b, int c) {
vector<int> stones = {a, b, c};
sort(stones.begin(), stones.end());
int left = 0, min_moves = numeric_limits<int>::max();
int max_moves = stones.back() - stones.front() - (stones.size() - 1);
for (int right = 0; right < stones.size(); ++right) {
while (stones[right] - stones[left] + 1 > stones.size()) { // find window size <= len(stones)
++left;
}
min_moves = min(min_moves, static_cast<int>(stones.size()) - (right - left + 1));
}
return {min_moves, max_moves};
}
};
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/LilithSangreal/LeetCode-Solutions.git
git@gitee.com:LilithSangreal/LeetCode-Solutions.git
LilithSangreal
LeetCode-Solutions
LeetCode-Solutions
master

搜索帮助