C語言實作
順序表的存盤結構實作堆疊
代碼:
#include <stdlib.h> #include <stdio.h> #define STACK_INIT_SIZE 100 //堆疊初始開辟空間大小 #define STACK_INCREMENT 10 //堆疊追加空間大小 //堆疊的結構體 typedef struct stack{ int *base; int *top; int size; }binStack; //堆疊初始化 binStack stack_init() { binStack bs; bs.base = (int *)malloc(sizeof(int)*STACK_INIT_SIZE); bs.top = bs.base; bs.size = STACK_INIT_SIZE; return bs; } //入堆疊 void push(binStack *bs, int e) { if(bs->top - bs->base >= bs->size) { bs->size += STACK_INCREMENT; bs->base = realloc(bs->base, bs->size); } *(bs->top++) = e; } //出堆疊 int pop(binStack *bs) { if(bs->top != bs->base) { bs->top--; return *bs->top; } return -1; } //主函式 void main() { int dec; binStack bs = stack_init(); printf("請輸入十進制整數:\n"); scanf("%d", &dec); while(dec) { push(&bs, dec%2); dec /= 2; } printf("轉換后的二進制數是:\n"); while(bs.top != bs.base) { printf("%d", pop(&bs)); } printf("\n\n"); system("date /T"); system("TIME /T"); system("pause"); exit(0); }
運行結果:
Python實作
對于stack我們可以使用python內置的list實作(也可以用鏈表實作),因為list是屬于線性陣列,在末尾插入和洗掉一個元素所使用的時間都是O(1),這非常符合stack的要求,
代碼:
import datetime //顯示時間引入的庫 import time // from pip._vendor.distlib.compat import raw_input //使命令視窗不立即關閉引入的庫 //堆疊類 class BinStack: def __init__(self): self.bs = [] //入堆疊 def push(self, e): self.bs.append(e) //出堆疊 def pop(self): if self.bs: return self.bs.pop() else: raise LookupError("stack is empty!") //檢查堆疊是否為空,是回傳False,不是回傳True def isEmpty(self): return bool(self.bs) if __name__ == '__main__': binStack = BinStack() dec = int(input("請輸入十進制整數:\n")) print("轉換后的二進制數是:") while dec != 0: binStack.push(dec%2) dec //= 2 while binStack.isEmpty() == True: print("{}".format(binStack.pop()), end="") else: print("\n") //列印時間 datetime = datetime.datetime.now() print(datetime.strftime("%Y-%m-%d\n%H:%M:%S")) //使命令視窗不立即關閉 input("Press Enter to exit…")
運行結果:
以上就是Python和C語言利用堆疊分別實作進制轉換的詳細內容,
轉載請註明出處,本文鏈接:https://www.uj5u.com/houduan/518710.html
標籤:Python
