leetcode1號題目(兩種解法)

暴力解法web class Solution { public: vector<int> twoSum(vector<int> &nums, int target) { vector<int> result; int N = nums.size(); for (int i = 0; i < N - 1; i++)

>>阅读原文<<