笔试强训(五)

一.游游的you

https://www.nowcoder.com/questionTerminal/cd117803b3364b218a8b3dcc498dee25

#include <iostream>
using namespace std;int main()
{int q;int a, b, c;cin >> q;while(q--){cin >> a >> b >> c;int x = min(a, min(b, c));cout << (x * 2 + max(b - x - 1, 0)) << endl;}return 0;
}

二.腐烂的苹果

https://www.nowcoder.com/practice/54ab9865ce7a45968b126d6968a77f34?tpId=196&tqId=40529&ru=/exam/oj

class Solution {int n, m;int dir[4][2] = { {0,1},{0,-1},{1,0},{-1,0} };bool vis[1010][1010] = { 0 };public:/*** 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可*** @param grid int整型vector<vector<>>* @return int整型*/int rotApple(vector<vector<int> >& grid) {// write code heren = grid.size();m = grid[0].size();queue<pair<int, int>> q;for (int i = 0; i < n; i++){for (int j = 0; j < m; j++){if (grid[i][j] == 2){q.push({ i,j });}}}int ret = 0;while (q.size()){int sz = q.size();while (sz--){auto [a, b] = q.front();q.pop();for (int i = 0; i < 4; i++){int x = a + dir[i][0];int y = b + dir[i][1];if (x >= 0 && x < n && y >= 0 && y < m && grid[x][y] == 1 && !vis[x][y]){vis[x][y] = true;q.push({ x,y });}}}ret++;}for (int i = 0; i < n; i++){for (int j = 0; j < m; j++){if (grid[i][j] == 1 && !vis[i][j]){return -1;}}}return ret - 1;}
};

三.孩子们的游戏(约瑟夫环)

https://www.nowcoder.com/practice/f78a359491e64a50bce2d89cff857eb6?tpId=13&tqId=11199&ru=/exam/oj

class Solution {
public:/*** 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可** * @param n int整型 * @param m int整型 * @return int整型*/int LastRemaining_Solution(int n, int m) {// write code hereint f = 0;for (int i = 2; i <= n; i++){f = (f + m) % i;}return f;}
};