數據結構基礎

前置：算法複雜度 O(1) int n = 1000; System.out.println(n); O(N) for (int i = 1; i <= n ; i++){ System.out.println( i ); } O(n^2) for (int i = 1; i <= n; i++) { for (int j

>>阅读原文<<