题解 | #寻找两头牛的情报关联#
寻找两头牛的情报关联
https://www.nowcoder.com/practice/5cb34321b6dd41bcbea3db454c2f6e9f
class Solution { public: /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param info int整型vector * @param target_weight int整型 * @return int整型vector */ vector<int> findWeightRelation(vector<int>& info, int target_weight) { // write code here vector<int> ans{-1, -1}; for (int i = 0; i < info.size()-1; i++) { for (int j = i+1; j < info.size(); j++) { if (info[j] + info[i] > target_weight) { break; } if (info[j] + info[i] == target_weight) { ans[0] = i+1; ans[1] = j+1; return ans; } } } return ans; } };