摘要：
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequ 阅读全文
posted @ 2017-11-22 07:34
逸朵
阅读(176)
评论(0)
推荐(0)
摘要：
A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy 阅读全文
posted @ 2017-11-22 06:24
逸朵
阅读(100)
评论(0)
推荐(0)
摘要：
Given an array of integers, every element appears three times except for one, which appears exactly once. Find that single one. Note:Your algorithm sh 阅读全文
posted @ 2017-11-22 05:51
逸朵
阅读(110)
评论(0)
推荐(0)
摘要：
Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. OJ's undirected graph serialization: Nodes are labeled 阅读全文
posted @ 2017-11-22 05:20
逸朵
阅读(164)
评论(0)
推荐(0)
摘要：
Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioning 阅读全文
posted @ 2017-11-22 04:00
逸朵
阅读(127)
评论(0)
推荐(0)
摘要：
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 @ 2017-11-22 02:36
逸朵
阅读(166)
评论(0)
推荐(0)
摘要：
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 @ 2017-11-22 02:15
逸朵
阅读(144)
评论(0)
推荐(0)
浙公网安备 33010602011771号