| | | | |

2016年11月10日

leetcode 131. Palindrome Partitioning----- java

摘要： Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For exampl 阅读全文

posted @ 2016-11-10 18:04 xiaoba1203 阅读(283) 评论(0) 推荐(0) 编辑

leetcode 130. Surrounded Regions----- java

摘要： Given a 2D board containing 'X' and 'O' (the letter O), capture all regions surrounded by 'X'. A region is captured by flipping all 'O's into 'X's in 阅读全文

posted @ 2016-11-10 17:29 xiaoba1203 阅读(651) 评论(0) 推荐(0) 编辑

2016年11月10日

公告