04 2013 档案

摘要：没有资格。事实上很差劲 阅读全文

摘要：You are given a 2-D array with same number of rows and columns. You have to determine the longest snake in the array. The property to find the snake is the difference between the adjacent(left, right, up or down) should be either 1 or -1. If there are more than one snakes with maximum length, the ou 阅读全文