西电梁飞翔的专栏

问题描述： You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will

问题描述： Given an unsorted array return whether an increasing sub sequence of length 3 exists or not in the array. Formally the function should: Return true if there exists i, j, k  such that arr[i]

问题描述： You are given an array x of n positive numbers. You start at point (0,0) and moves x[0] metres to the north, then x[1] metres to the west, x[2] metres to the south,x[3] metres to