SS的博客

冒泡排序 时间是o(n2) 首先从序号0开始直到数组长度减1，查找最大值，并两两交换，将最大值交换到最后， import java.util.*; public class BubbleSort { public int[] bubbleSort(int[] A, int n) { // write code here int t = 0;

Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements of [1, n] inclusive that do not appear in this array.