摘要: Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:On... 阅读全文
posted @ 2018-09-24 18:12 vercont 阅读(174) 评论(0) 推荐(0) 编辑
摘要: Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:On... 阅读全文
posted @ 2018-09-24 18:12 vercont 阅读(129) 评论(0) 推荐(0) 编辑
摘要: Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictio... 阅读全文
posted @ 2018-09-24 18:12 vercont 阅读(86) 评论(0) 推荐(0) 编辑
摘要: Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictio... 阅读全文
posted @ 2018-09-24 18:12 vercont 阅读(144) 评论(0) 推荐(0) 编辑
摘要: Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.Re... 阅读全文
posted @ 2018-09-24 18:12 vercont 阅读(89) 评论(0) 推荐(0) 编辑
摘要: Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.Re... 阅读全文
posted @ 2018-09-24 18:12 vercont 阅读(173) 评论(0) 推荐(0) 编辑
摘要: Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example, "A man, a pl... 阅读全文
posted @ 2018-09-24 18:12 vercont 阅读(103) 评论(0) 推荐(0) 编辑
摘要: Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example, "A man, a pl... 阅读全文
posted @ 2018-09-24 18:12 vercont 阅读(143) 评论(0) 推荐(0) 编辑
摘要: Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For exampl... 阅读全文
posted @ 2018-09-24 18:11 vercont 阅读(134) 评论(0) 推荐(0) 编辑
摘要: Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For exampl... 阅读全文
posted @ 2018-09-24 18:11 vercont 阅读(155) 评论(0) 推荐(0) 编辑