摘要： https://leetcode.com/problems/two-sum/description/ 思路：暴力，对于每个数num[i]，查找target-num[i]，找到则返回i，j。 代码： /** * Note: The returned array must be malloced, as 阅读全文