ZOJ 1027
摘要：
最长公共子序列 变形 #pragma comment(linker, "/STACK:1024000000,1024000000")#include #include #include #include #include #include #include #include #include #... 阅读全文
posted @ 2016-07-12 10:45 胖胖的乓乓 阅读(129) 评论(0) 推荐(0) 编辑
HDU 1711 Number Sequence
摘要：
Number Sequence Time Limit: 5000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u Submit Status Description Given two sequence... 阅读全文
posted @ 2016-07-12 10:41 胖胖的乓乓 阅读(149) 评论(0) 推荐(0) 编辑
HDU - 2087 剪花布条
摘要：
HDU - 2087 剪花布条 Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u Submit Status Description 一块花布条，里面有些图案，另... 阅读全文
posted @ 2016-07-12 10:36 胖胖的乓乓 阅读(178) 评论(0) 推荐(0) 编辑
ZOJ - 1149 Dividing
摘要：
ZOJ - 1149 (Crawling failed) Dividing Time Limit: 2MS Memory Limit: 65536KB 64bit IO Format: %lld & %llu Status Description Mar... 阅读全文
posted @ 2016-07-12 10:32 胖胖的乓乓 阅读(154) 评论(0) 推荐(0) 编辑
Remove Duplicates from Sorted List II
摘要：
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * };... 阅读全文
posted @ 2016-07-08 11:46 胖胖的乓乓 阅读(134) 评论(0) 推荐(0) 编辑
Reverse Nodes in k-Group
摘要：
25. Reverse Nodes in k-Group Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. If the number of n... 阅读全文
posted @ 2016-07-08 10:44 胖胖的乓乓 阅读(125) 评论(0) 推荐(0) 编辑
Swap Nodes in Pairs
摘要：
24. Swap Nodes in Pairs Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should return ... 阅读全文
posted @ 2016-07-08 10:09 胖胖的乓乓 阅读(112) 评论(0) 推荐(0) 编辑
Merge k Sorted Lists
摘要：
23. Merge k Sorted Lists Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Subscrib... 阅读全文
posted @ 2016-07-08 09:36 胖胖的乓乓 阅读(119) 评论(0) 推荐(0) 编辑
21. Merge Two Sorted Lists
摘要：
21. Merge Two Sorted Lists Question Editorial Solution My Submissions Merge two sorted linked lists and return it as a new list. The... 阅读全文
posted @ 2016-07-07 23:17 胖胖的乓乓 阅读(77) 评论(0) 推荐(0) 编辑
19. Remove Nth Node From End of List
摘要：
Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. ... 阅读全文
posted @ 2016-07-07 22:50 胖胖的乓乓 阅读(120) 评论(0) 推荐(0) 编辑
