Question

我想创建一个链表。用户添加数字，并且想法是数字按降序插入列表。

这就是我所做的，但是当重新排列时，它只是命令第一个数字......

int addInputNumber(numberList **node){

  numberList *temp;
  int userInput;
  temp = (numberList*)malloc(sizeof(numberList));
  //Memory Check
  if ( temp == 0 )//out of memory, return 0
      return 0;
  //Get the users input
  printf("Give me a Number!\n");
  scanf("%d",&userInput);

 //Add it to the list.
  temp->numbero = userInput;
  ///Link to the list.
  temp->next = *node; 
  *node = temp; 

  //Lets cycle through the list.
  numberList *temp2;
  int helpNumber;
  temp2 = *node;

  //Rearrange the list.
  while(temp2 != 0){
    if(temp->numbero < temp2->numbero){

      //Switch position..
      helpNumber= temp2->numbero;
      temp2->numbero = temp->numbero;
      temp->numbero = helpNumber;
      temp2 = *node;// If we change number, we must cycle from the beginning AGAIN. 
    }//eof if
    temp2 = temp2->next;
  }//eof while

  return 0;
}//eof addNUmber function.

以下是结构：

typedef struct dynamicNumberList {
  int numbero;
  struct dynamicNumberList *next;
}numberList;

我有两个快速的问题。

为什么只安排第一个号码？
此列表在左侧（视觉上）添加了一个空格，我怎么能这样做以便我可以向右边添加一个空格？

Answer 1

你需要养成为每个任务创建一个函数的习惯，而不是将所有内容都塞进一个任务中。它使代码更易于阅读和重用，并减少出错的可能性。

正确的实现可能如下所示：

#include <stdio.h>
#include <stdlib.h>

typedef struct s_List
{
  int n;
  struct s_List *next;
} List;

void print_list (List *head)
{
    List *ptr;

    for (ptr = head; ptr; ptr = ptr->next) {
        printf ("%d\t", ptr->n);
    }
    putchar ('\n');
}

List * make_node (int n, List *next)
{
    List * node = malloc (sizeof(List));
    node->n = n;
    node->next = next;
    return node;
}

void insert_number_front (List **head, int n)
{
    *head = make_node (n, *head);
}

void insert_number_after (List *prev, int n)
{
    prev->next = make_node (n, prev->next);
}

// If HEAD is sorted, it will stay sorted after insertion
void insert_number_sorted (List **head, int n)
{
    List *ptr;
    List *ptr2;

    // search for the rightmost node whose number is smaller than n.
    ptr2 = NULL;
    for (ptr = *head; ptr; ptr = ptr->next) {
        if (ptr->n >= n)
            break;
        ptr2 = ptr;
    }

    // If such a node exists we insert the new node after it,
    // otherwise we insert it at the front of the list.
    if (ptr2) {
        insert_number_after (ptr2, n);
    }
    else {
        insert_number_front (head, n);
    }
}   

int input_number ()
{
    int n;

    printf ("enter a number: ");
    scanf ("%d", &n);
    return n;
}

int main ()
{
    List *head = NULL;
    int i;

    // By adding elements exclusively with insert_number_sorted()
    // we ensure the list is always sorted
    for (i = 0; i < 5; i++) {
        int n;

        n = input_number ();
        insert_number_sorted (&head, n);
    }

    print_list (head);

    return 0;
}

要回答你的第二个问题，你在这里有一个单链表，可以通过指向第一个节点的指针来描述。如果您希望能够在后面插入节点，则需要维护指向最后一个节点的附加指针。但是，在这种情况下，这不是必需的。

循环列表和订购

1 个答案: