Angelof7的专栏

I found the Knapsack problem tricky and interesting at the same time. I am sure if you are visiting this page, you already know the problem statement but just for the sake of completion : Problem:

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy of the list. public RandomListNode co

Problem I: Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? Problem II: Given a linked list, return the node where the cycle b

时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 There are N islands on a planet whose coordinates are (X1, Y1), (X2, Y2), (X3, Y3) ..., (XN, YN). You starts at the 1st island (X1, Y1) a