2021.3.3 每日复习 139.单词拆分（动态规划）+ 142.环形链表II（双指针）

139.单词拆分（动态规划）

class Solution {
    public boolean wordBreak(String s, List<String> wordDict) {
    	int len = s.length();
		Set<String> set = new HashSet<>();
		int maxLen = -1;
		for(String word : wordDict) {
			if(maxLen < word.length()) maxLen = word.length();
			set.add(word);
		}
		boolean[] dp = new boolean[len + 1];
		dp[0] = true;
		for(int i = 1; i < dp.length; i++) {
			for(int j = Math.max(0, i - maxLen); j < i; j++) {
				if(dp[j] && set.contains(s.substring(j, i))) {
					dp[i] = true;
					break;
				}
			}
		}
		return dp[len];
    }
}

---

142.环形链表II（双指针）

public class Solution {
    public ListNode detectCycle(ListNode head) {
    	if(head == null || head.next == null) return null;
		ListNode fast = head;
		ListNode slow = head;
		while(true) {
			fast = fast.next.next;
			slow = slow.next;
			if(fast == slow) break;
		}
		fast = head;
		while(fast != slow) {
			fast = fast.next;
			slow = slow.next;
		}
		return fast;
    }
}