摘要:
class Solution { public: int divide(int dividend, int divisor) { // 处理特殊情况 if (divisor == 1) return dividend; if (divisor == -1) { if (dividend == INT 阅读全文
摘要:
https://leetcode.cn/problems/ZL6zAn/ class Solution { public: void DFS(vector<vector<int>>& grid, int i, int j, int M, int N, int& sum) { if (grid[i][ 阅读全文
摘要:
int removeElement(vector<int>& nums, int val) { int slow = 0; for (int fast = 0; fast < nums.size(); ++fast) { if (nums[fast] != val) { nums[slow++] = 阅读全文
摘要:
https://leetcode.cn/problems/unique-paths-ii/ class Solution { public: int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) { int m = obsta 阅读全文