1. 两数之和
This commit is contained in:
@@ -5,7 +5,7 @@ public:
|
||||
vector<int> idxs;
|
||||
for(int i = 0; i < n; i++) idxs.push_back(i);
|
||||
|
||||
// Can<EFBFBD><EFBFBD>t be sorted directly
|
||||
// Can't be sorted directly
|
||||
sort(idxs.begin(), idxs.end(), [&nums](int i, int j){
|
||||
return nums[i] < nums[j];
|
||||
});
|
||||
|
||||
Reference in New Issue
Block a user