shanshanhi的博客

1.Single NumberGiven an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you impleme

#include <iostream>using namespace std;int countOne(int n)//统计二进制表示中所含1的个数{ int num=0; if(n==0) num=0; else { while(n) { n&=(n-1); num++

void HeapSort(int a[],int n){ int i; for(i = n/2; i > 0; i--){//构建初始堆 HeapAdjust(a,i,n); } for(i = n; i > 1; i--){//不断输出最大元素进行排序，输出后继续调整 swap(a,1,i); HeapAdjust(a,1,i-1); }}void HeapA