int biTofh(int bi,int len){//二進(jìn)制轉(zhuǎn)化為正負(fù)號(hào)
        int i=0;
        while(i<len){
                int tmp = 1;
                if((bi & (tmp<<(len-i-1))) != 0){//從最左位開(kāi)始比較，該位是1
                        printf(" + ");
                }
                else{
                        printf(" - ");
                }
                i++;   
        }
        printf("/n");
        return 0;
}

int main(){
        int input[] = {1,2,3,4,5};
        biTofh(20,5);
        return 0;
}

xu@xu-ThinkPad-X61:~/algorithm$ ./a.out
 +  -  +  -  -
xu@xu-ThinkPad-X61:~/algorithm$