小编Har*_*ain的帖子

给定代码的时间复杂度是多少?

import java.util.Scanner;


public class PairsOfElementsSumEqualsN {

    public static void main(String[] args) {
        // TODO Auto-generated method stub

        Scanner s  = new Scanner(System.in);

        System.out.println("enter the number");

        int n = s.nextInt();

        int[] array = new int[]{1,2,1,2,4,5,6,7,8,9};

        int j = 0;
        int i = 0;

        for(i = 0 ; i<array.length;i++)
        {
            for(j=i+1;j<array.length;j++)
            {
                if(array[i] + array[j] == n)
                {
                    System.out.println(array[i] + "," + array[j]);
                }

            }
        }

    }

}
Run Code Online (Sandbox Code Playgroud)

我认为它应该是n ^ 2但我想要答案的解释

java time-complexity

1
推荐指数
1
解决办法
325
查看次数

标签 统计

java ×1

time-complexity ×1