數(shù)據(jù)結(jié)構(gòu)是C 語言面試中的關(guān)鍵知識(shí)點(diǎn)：指針和數(shù)組：理解指針指向數(shù)組起始地址並用於訪問和修改數(shù)組元素。鍊錶：實(shí)現(xiàn)單向鍊錶，掌握創(chuàng)建、插入和刪除操作。棧：利用數(shù)組構(gòu)建棧，理解壓棧、出棧和查看棧頂操作。隊(duì)列：使用數(shù)組實(shí)現(xiàn)隊(duì)列，掌握入隊(duì)、出隊(duì)和查看隊(duì)首操作。

C 語言數(shù)據(jù)結(jié)構(gòu)：常見面試問題剖析

在許多編程面試中，數(shù)據(jù)結(jié)構(gòu)都是不可避免的話題。掌握C 語言中的常見數(shù)據(jù)結(jié)構(gòu)及其應(yīng)用對(duì)於求職者來說至關(guān)重要。

1. 指針和數(shù)組

• 理解指針指向數(shù)組起始地址的原理。

   int arr[] = {1, 2, 3, 4, 5};
  int *ptr = arr; // 指向數(shù)組首元素

• 使用指針訪問和修改數(shù)組元素。

   printf("%d\n", *ptr); // 輸出1
  *ptr ; // 指向下一個(gè)數(shù)組元素printf("%d\n", *ptr); // 輸出2

2. 鍊錶

• 實(shí)現(xiàn)單向鍊錶及其基本操作（創(chuàng)建、插入、刪除）。

   struct node {
    int data;
    struct node *next;
  };
  
  struct node *head = NULL; // 鍊錶頭部// 創(chuàng)建鍊錶void create_list(int data) {
    struct node *new_node = malloc(sizeof(struct node));
    new_node->data = data;
    new_node->next = NULL;
  
    if (head == NULL) {
        head = new_node;
    } else {
        struct node *current = head;
        while (current->next != NULL) {
            current = current->next;
        }
        current->next = new_node;
    }
  }
  
  // 插入節(jié)點(diǎn)到鍊錶特定位置void insert_node(int data, int position) {
    struct node *new_node = malloc(sizeof(struct node));
    new_node->data = data;
  
    if (position == 0) {
        new_node->next = head;
        head = new_node;
    } else {
        struct node *current = head;
        for (int i = 0; i < position - 1 && current != NULL; i ) {
            current = current->next;
        }
  
        if (current != NULL) {
            new_node->next = current->next;
            current->next = new_node;
        }
    }
  }
  
  // 刪除鍊錶特定位置的節(jié)點(diǎn)void delete_node(int position) {
    struct node *current = head;
  
    if (position == 0) {
        head = head->next;
    } else {
        for (int i = 0; i < position - 1 && current != NULL; i ) {
            current = current->next;
        }
  
        if (current != NULL && current->next != NULL) {
            struct node *temp = current->next;
            current->next = temp->next;
            free(temp);
        }
    }
  }

3. 棧

• 實(shí)現(xiàn)棧並使用數(shù)組模擬，理解棧的基本操作（壓棧、出棧、查看棧頂）。

   #define MAX_SIZE 100
  
  int stack[MAX_SIZE];
  int top = -1; // 棧頂指針// 壓棧void push(int data) {
    if (top == MAX_SIZE - 1) {
        printf("Stack overflow\n");
    } else {
        stack[ top] = data;
    }
  }
  
  // 出棧int pop() {
    if (top == -1) {
        printf("Stack underflow\n");
        return -1;
    } else {
        return stack[top--];
    }
  }
  
  // 查看棧頂元素int peek() {
    if (top == -1) {
        printf("Empty stack\n");
        return -1;
    } else {
        return stack[top];
    }
  }

4. 隊(duì)列

• 使用數(shù)組實(shí)現(xiàn)隊(duì)列，理解隊(duì)列的基本操作（入隊(duì)、出隊(duì)、查看隊(duì)首）。

   #define MAX_SIZE 100
  
  int queue[MAX_SIZE];
  int front = -1, rear = -1;
  
  // 入隊(duì)void enqueue(int data) {
    if ((front == 0 && rear == MAX_SIZE - 1) || (rear 1 == front)) {
        printf("Queue overflow\n");
    } else if (front == -1) {
        front = rear = 0;
        queue[rear] = data;
    } else if (rear == MAX_SIZE - 1) {
        rear = 0;
        queue[rear] = data;
    } else {
        rear ;
        queue[rear] = data;
    }
  }
  
  // 出隊(duì)int dequeue() {
    if (front == -1) {
        printf("Queue underflow\n");
        return -1;
    } else if (front == rear) {
        int data = queue[front];
        front = rear = -1;
        return data;
    } else {
        int data = queue[front];
        front ;
        return data;
    }
  }
  
  // 查看隊(duì)首元素int peek() {
    if (front == -1) {
        printf("Queue empty\n");
        return -1;
    } else {
        return queue[front];
    }
  }

以上是C語言數(shù)據(jù)結(jié)構(gòu)：常見面試問題剖析的詳細(xì)內(nèi)容。更多資訊請(qǐng)關(guān)注PHP中文網(wǎng)其他相關(guān)文章！