leetcode-1-兩數之和

  bool cmp(pair<int, int> a, pair<int, int> b) {     return (a.first < b.first); } class Solution { public:     vector<int> twoSum(vector<int>& nums, int target) {         vector<pair<int, int>> index

>>阅读原文<<