刷题记录

剑指 Offer 04. 二维数组中的查找 方法：找到大小和行列之间的规律 注意：边界条件，比如数组为空 class Solution { public: bool findNumberIn2DArray(vector<vector<int>>&amp; matrix, int target) { if (matrix.size() <= 0) return 0; int i = 0; int j = matrix[0].size() - 1; while (i < matrix.size() &amp;&amp; j >= 0) { if (matrix[i][j] == target) { return 1; } else if (matrix[i][j] < target) { i++; } else j--; } return 0; } };

剑指 Offer 03. 数组中重复的数字：用map找重复的 class Solution { public: int findRepeatNumber(vector<int>&amp; nums) { map<int, int>map; for (int i= 0; i<nums.size(); i++) { auto it = map.find(nums[i]); if (it != map.end()) { return nums[i]; } map[nums[i]] = i; } return 0; } };