LeetCode
Victor-Dan
这个作者很懒,什么都没留下…
展开
-
判断链表是否有环的快慢指针法
//快慢指针能相遇说明有环! public class Solution { public boolean hasCycle(ListNode head) { if(head==null) return false; ListNode fast=head; ListNode slow=head; whi...转载 2019-04-01 09:20:39 · 539 阅读 · 0 评论 -
LeetCode:word-break-ii
题目描述 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. Return all such possible sentences. For example, given s =“cat...原创 2019-04-01 22:04:27 · 98 阅读 · 0 评论 -
LeetCode:word-break
LeetCode:word-break题目描述代码实现 题目描述 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 dictionary words. For example, given s ...原创 2019-04-17 16:37:42 · 213 阅读 · 0 评论