Discuss / Java / 倒排
Back

倒排

Topic source

高处不胜寒

#1 Created at ... [Delete] [Delete and Lock User] 
for (int i = 0; i < ns.length; i++) {    for (int j = 1; j < ns.length - i; j++) {        if (ns[j - 1] < ns[j]) {            int temp = ns[j];            ns[j] = ns[j - 1];            ns[j - 1] = temp;        }    }}
  • 1

Reply