numbstorm的博客

题目描述：  Given a 2D board containing 'X' and 'O', capture(捕获) all regions surrounded by 'X'.  A region is captured by flipping all 'O's into 'X's in that surrounded region.  (给定一个包含"X"和"O"的二维板，捕捉所有被X包围的...

题目描述： Given a string containing only digits, restore it by returning all possible valid IP address combinations. For example:    Given "25525511135",    return ["255.255.11.135", "255.255.111.35

题目描述： Given a set of distinct integers, S, return all possible subsets. Note:     Elements in a subset must be in non-descending order.     The solution set must not contain duplicate subsets.   

题目描述： Write a program to solve a Sudoku puzzle by filling the empty cells. Empty cells are indicated by the character '.'. You may assume that there will be only one unique solution. 意思就是解一个数独。 p

题目描述： Follow up for N-Queens problem. Now, instead outputting board configurations, return the total number of distinct solutions. 思路：同N Queens一样，是一道题求的结果不同。 public class N_QueensTwo { public s

题目描述： The n-queens puzzle is the problem of placing n queens on an n×n chessboard  such that no two queens attack each other. Given an integer n, return all distinct solutions to the n-queens pu

题目描述：Given a 2D board and a word, find if the word exists in the grid.                 The word can be constructed from letters of sequentially adjacent cell,                 where “adjacent” cell