1957

摘要： valid rowvalid colvalid blockclass Solution {public: bool isValidSudoku(vector > &board) { unordered_set vis; //valid row for(int i = 0 ; i = '1' && board[i][j] = '1' && board[j][i] = '1' && board[i + row][j + col] <= '9' && v 阅读全文

摘要： 裸的lower_bound, upper_bound的实现...还有点晕,等下看...边界调来调去的过了...看来正确实现二分真不容易class Solution {public: int low(int A[] , int start , int end , int target) { int l = 0; int r = end; while(l searchRange(int A[], int n, int target) { vector ans; if(n <= 0) return ans; ... 阅读全文

摘要： 有人用了很复杂的讨论-，-我感觉我是考虑不了那么多。。那么我先二分找到那个分割点，然后。。。分两段来二分找class Solution {public: int bs(int A[] , int start , int end , int target){ int l = sta... 阅读全文