丧心病狂工科女

2019年2月9日

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805354762715136 British astronomer Eddington liked to ride a bike. It is said that in or 阅读全文

posted @ 2019-02-09 14:47 丧心病狂工科女阅读(402) 评论(0) 推荐(0) 编辑

#Leetcode# 61. Rotate List

摘要： https://leetcode.com/problems/rotate-list/ Given a linked list, rotate the list to the right by k places, where k is non-negative. Example 1: Example 阅读全文

posted @ 2019-02-09 11:34 丧心病狂工科女阅读(128) 评论(0) 推荐(0) 编辑

#Leetcode# 725. Split Linked List in Parts

摘要： https://leetcode.com/problems/split-linked-list-in-parts/ Given a (singly) linked list with head node root, write a function to split the linked list 阅读全文

posted @ 2019-02-09 11:06 丧心病狂工科女阅读(122) 评论(0) 推荐(0) 编辑

2019年2月8日

PAT 甲级 1106 Lowest Price in Supply Chain

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805362341822464 A supply chain is a network of retailers（零售商）, distributors（经销商）, and su 阅读全文

posted @ 2019-02-08 13:06 丧心病狂工科女阅读(497) 评论(0) 推荐(0) 编辑

PAT 甲级 1105 Spiral Matrix

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805363117768704 This time your job is to fill a sequence of N positive integers into a s 阅读全文

posted @ 2019-02-08 11:15 丧心病狂工科女阅读(562) 评论(0) 推荐(0) 编辑

2019年2月6日

PAT 甲级 1051 Pop Sequence

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805427332562944 Given a stack which can keep M numbers at most. Push N numbers in the or 阅读全文

posted @ 2019-02-06 21:25 丧心病狂工科女阅读(121) 评论(0) 推荐(0) 编辑

#Leetcode# 373. Find K Pairs with Smallest Sums

摘要： https://leetcode.com/problems/find-k-pairs-with-smallest-sums/ You are given two integer arrays nums1 and nums2 sorted in ascending order and an integ 阅读全文

posted @ 2019-02-06 11:17 丧心病狂工科女阅读(127) 评论(0) 推荐(0) 编辑

PAT 甲级 1021 Deepest Root

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805482919673856 A graph which is connected and acyclic can be considered a tree. The hig 阅读全文

posted @ 2019-02-06 02:01 丧心病狂工科女阅读(121) 评论(0) 推荐(0) 编辑

2019年2月5日

PAT 甲级 1004 Counting Leaves

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805521431773184 A family hierarchy is usually presented by a pedigree tree. Your job is 阅读全文

posted @ 2019-02-05 13:08 丧心病狂工科女阅读(135) 评论(0) 推荐(0) 编辑

PAT 甲级 1126 Eulerian Path

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805349851185152 In graph theory, an Eulerian path is a path in a graph which visits ever 阅读全文

posted @ 2019-02-05 11:49 丧心病狂工科女阅读(125) 评论(0) 推荐(0) 编辑

丧心病狂工科女

公告