XDOJ【258】链表去重

链表去重

#include<stdio.h>
#include<stdlib.h>
typedef struct {
    int address;
    int key;
    int next;
}Elem;
int main(){
    int address_1; //接收首结点地址
    int n; //接收结点个数
    int i = 0, j = 0, k = 0, count = 0;
    Elem node;//临时结构体变量
    Elem *old_array, *new_array; //老数组用来接收输入的结点，新数组存放排序后的结点。
    scanf("%d %d", &address_1, &n);
    old_array = (Elem*)malloc(n*sizeof(Elem));//分配空间
    new_array = (Elem*)malloc(n*sizeof(Elem));
    for(i = 0; i < n; i ++){//接收结点
        scanf("%d %d %d", &old_array[i].address, &old_array[i].key, &old_array[i].next);
    }
    //找到老数组中的首结点，将其存入新数组中。
    for(i = 0; i < n; i ++){
        if(old_array[i].address == address_1){
            node = old_array[i];
            new_array[k] = old_array[i];
            k++;
            break;
        }
    }
    //将老数组中的元素按链表正确排序放入新数组
    for(j = 1; j < n; j ++){
        for(i = 0; i < n; i ++){
            if(old_array[i].address == node.next){
                node = old_array[i];
                new_array[k] = node;
                k++;
                break;
            }
        }
    }
    count = n; 
    //去重
    for(j = 1; j < n; j ++){
        for(i = 0; i < j; i ++){
            if(abs(new_array[i].key) == abs(new_array[j].key)){
                k = j-1;
                while(1){
                    if(new_array[k].address == -1){
                        k--;
                        continue;
                    }
                    new_array[k].next = new_array[j].next;
                    new_array[j].address = -1;
                    break;
                }
                count --;
                break;
            }
        }
    }
    //输出
    printf("%d\n", count);
    node = new_array[0];
    i = 0;
    if(count == 1){
        printf("%05d %d -1\n", node.address, node.key, node.next);
    }else{
        printf("%05d %d %05d\n", node.address, node.key, node.next);
    }
    while(count>1){
        for(i = 1; i < n; i ++){
            if(new_array[i].address == node.next){
                node = new_array[i];
                if(count == 2)
                {
                    printf("%05d %d -1\n", node.address, node.key, node.next);
                }else{
                    printf("%05d %d %05d\n", node.address, node.key, node.next);
                }
                break;
            }
        }
        count--;
    }
    return 0;
}