DescriptionYou are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse ca...
分类：
其他好文 时间：
2015-01-20 20:27:10
阅读次数：
191
There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he c...
分类：
其他好文 时间：
2015-01-20 13:31:48
阅读次数：
148
A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The robot can only move either down or right at any point ...
分类：
其他好文 时间：
2015-01-19 22:27:00
阅读次数：
150
Given a binary tree where all the right nodes are either leaf nodes with a sibling (a left node that shares the same parent node) or empty, flip it up...
分类：
其他好文 时间：
2015-01-19 09:07:58
阅读次数：
134
https://oj.leetcode.com/problems/climbing-stairs/You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or...
分类：
其他好文 时间：
2015-01-16 22:20:56
阅读次数：
252
Problem JBitsInput:Standard InputOutput:Standard OutputAbitis a binary digit, taking a logical value of either "1" or "0" (also referred to as "true" ...
分类：
其他好文 时间：
2015-01-16 14:20:21
阅读次数：
212
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).
The robot can only move either down or right at any point in time. The robot is trying to reach the ...
分类：
其他好文 时间：
2015-01-15 23:56:23
阅读次数：
294
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.
Note: You can only move either down or right at...
分类：
其他好文 时间：
2015-01-15 09:28:07
阅读次数：
124
A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The robot can only move either down or right at any point ...
分类：
其他好文 时间：
2015-01-13 22:55:24
阅读次数：
195
You may either install or download a plugin. Note that for install, the web server needs to have access privileges to the /plugins folder on the file ...
分类：
其他好文 时间：
2015-01-13 15:46:03
阅读次数：
142
