NC61 两数之和

男娘i 2024-03-27 13:58 53阅读 0赞

> [牛客华为机试题库【题号 HJ开头】（重点看）][HJ]  
> [牛客在线编程算法篇【题号NC开头】][NC]  
> [剑指offer【题号 JZ开头】][offer_ JZ]  
> [力扣][Link 1]

### 1）[原题链接][Link 2] ###

### 2）已有题解 ###

### 3）代码 ###

package array;
    
    import java.io.BufferedReader;
    import java.io.IOException;
    import java.io.InputStreamReader;
    import java.util.Arrays;
    import java.util.Comparator;
    import java.util.stream.Collectors;
    
    import static java.lang.Integer.parseInt;
    import static java.lang.System.in;
    
    /**
     * NC61.两数之和
     */
    public class NC61SumOfTwoNumbers {
        
        public static void main(String[] args) throws IOException {
        
            BufferedReader bf = new BufferedReader(new InputStreamReader(in));
            int[] arr = Arrays.stream(bf.readLine().split(",")).mapToInt(Integer::parseInt).toArray();
            int num = parseInt(bf.readLine());
            bf.close();
    
            int[] res = getIntegers(arr, num);
    
            String collect = Arrays.stream(res).boxed().sorted(Comparator.naturalOrder()).map(String::valueOf).collect(Collectors.joining(","));
            System.out.println(collect);
        }
    
        /**
         * NC61.两数之和
         */
        private static int[] getIntegers(int[] numbers, int target) {
        
            int[] res = new int[2];
            for (int i = 0; i < numbers.length; i++) {
        
                if (numbers[i] > target) {
        
                    continue;
                }
                // 这种判断存在的场景时不存在回头路的，有回头也是前面收集过的，所以j=i+1
                for (int j = i + 1; j < numbers.length; j++) {
        
                    if (numbers[i] + numbers[j] == target) {
        
                        res[0] = i + 1;
                        res[1] = j + 1;
                        return res;
                    }
                }
            }
            return res;
        }
    }

[HJ]: https://www.nowcoder.com/exam/oj/ta?tpId=37
[NC]: https://www.nowcoder.com/exam/oj
[offer_ JZ]: https://www.nowcoder.com/exam/oj/ta?page=1&tpId=13&type=13
[Link 1]: https://leetcode.cn/problemset/all/
[Link 2]: https://www.nowcoder.com/practice/20ef0972485e41019e39543e8e895b7f?tpId=117&tqId=37756&rp=1&ru=/exam/oj&qru=/exam/oj&sourceUrl=/exam/oj?page=1&tab=%25E7%25AE%2597%25E6%25B3%2595%25E7%25AF%2587&topicId=117&difficulty=undefined&judgeStatus=undefined&tags=&title=