PAT_1052. Linked List Sorting

//
//  main.cpp
//  PAT_1052. Linked List Sorting
//
//  Created by wjq on 17/5/14.
//  Copyright © 2017年 wjq. All rights reserved.
//

#include <iostream>
#include <algorithm>
using namespace std;
struct node
{
    int from,key,to;
}n[100005],b[100005];
int N,start;
int cmp(node a,node b)
{
    return a.key<b.key;
}
int main(int argc, const char * argv[])
{
    scanf("%d%d",&N,&start);
    for(int i=0;i<N;i++)
    {
        int temp;
        scanf("%d",&temp);
        n[temp].from=temp;
        scanf("%d%d",&n[temp].key,&n[temp].to);
    }
    if(start==-1)
        printf("0 -1\n");
    else
    {
        int index=0;
        while(start!=-1)
        {
            b[index].from=n[start].from;
            b[index].key=n[start].key;
            b[index].to=n[start].to;
            start=n[start].to;
            index++;
        }
        sort(b,b+index,cmp);
        printf("%d %05d\n",index,b[0].from);
        for(int i=0;i<index;i++)
        {
            if(i!=index-1)
                printf("%05d %d %05d\n",b[i].from,b[i].key,b[i+1].from);
            else
                printf("%05d %d -1\n",b[i].from,b[i].key);
        }
    }
    return 0;
}


注意:

1.原链表可能为空链表.

2.原数据给出的节点可能不在原链表上.


对下面代码每一步含义进行注释 def convert_to_doubly_linked_list(self): if not self.root: return None def convert(root): if not root.left and not root.right: return ListNode(root.val) if not root.left: right_head = convert(root.right) right_tail = right_head while right_tail.next: right_tail = right_tail.next cur_node = ListNode(root.val, None, right_head) right_head.prev = cur_node return cur_node if not root.right: left_tail = convert(root.left) left_head = left_tail while left_head.prev: left_head = left_head.prev cur_node = ListNode(root.val, left_tail, None) left_tail.next = cur_node return cur_node left_tail = convert(root.left) right_head = convert(root.right) left_head = left_tail while left_head.prev: left_head = left_head.prev right_tail = right_head while right_tail.next: right_tail = right_tail.next cur_node = ListNode(root.val, left_tail, right_head) left_tail.next = cur_node right_head.prev = cur_node return left_head return convert(self.root) def inorder_traversal(self, root): if not root: return self.inorder_traversal(root.left) print(root.val, end=' ') self.inorder_traversal(root.right) def print_bst(self): self.inorder_traversal(self.root) print() def traverse_doubly_linked_list(self, head): cur_node = head while cur_node: print(cur_node.val, end=' ') cur_node = cur_node.next print() def reverse_traverse_doubly_linked_list(self, head): cur_node = head while cur_node.next: cur_node = cur_node.next while cur_node: print(cur_node.val, end=' ') cur_node = cur_node.prev print()
最新发布
06-12
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值