yangxiaozhe的专栏

15题实现思路在于 先将3个数 转换为2个数求第三个数的问题，注意去重 class Solution { public:     vector> threeSum(vector& nums) {                  vector> ver;         sort(nums.begin(), nums.end());         int len = nums.si

主要问题在于原始序号问题 class Solution { public:     vector twoSum(vector& nums, int target) {         int len = nums.size();         vector tmpvec(len,0);         for (int i = 0; i             tmpvec[i]

class Solution { public:     int threeSumClosest(vector& nums, int target) {         sort(nums.begin(), nums.end());         int len = nums.size();         int closet = 1000000;         int flag