【算法题】检查是否存在满足条件的数字组合

Myth丶恋晨 2024-03-27 09:07 14阅读 0赞

![在这里插入图片描述][dcb3043c79b442ae8fd4489ae9c6e0e3.png]

package array;
    
    import java.io.BufferedReader;
    import java.io.IOException;
    import java.io.InputStreamReader;
    import java.util.Arrays;
    
    public class SatisfyConditionCombinationNumbers {
        
        public static void main(String[] args) throws IOException {
        
            BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
            int total = Integer.parseInt(bf.readLine());
            Integer[] arr = Arrays.stream(bf.readLine().split(" ")).limit(total).map(Integer::parseInt).toArray(Integer[]::new);
            bf.close();
    
            // 降序为了便于快速找到
            Arrays.sort(arr, (a, b) -> b - a);
    
            // 中间状态flag
            boolean exist = false;
    
            for (int i = 0; i < arr.length; i++) {
        
                for (int j = 0; j < arr.length; j++) {
        
                    for (int k = 0; k < arr.length; k++) {
        
                        if (arr[i] == arr[j] + 2 * arr[k] && i != j && i != k && j != k) {
        
                            exist = true;
                            System.out.println(arr[i] + " " + arr[j] + " " + arr[k]);
                        }
                    }
                }
            }
    
            // 不存在的话输出0
            if (!exist) {
        
                System.out.println(0);
            }
        }
    }

[dcb3043c79b442ae8fd4489ae9c6e0e3.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/03/27/d521ca318d134dd1908122e2f1e492a8.png