摘要:
iterative: Core code recurring : Core code Reverse Linked List II Reverse a linked list from position m to n. Do it in-place and in one-pass. For exam 阅读全文
摘要:
BackTracking (DFS) 39. Combination Sum Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candi 阅读全文
摘要:
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longes 阅读全文
摘要:
Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the leng 阅读全文
摘要:
Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example,S = "ADOBECOD 阅读全文
摘要:
博主决定认真刷题~~~ Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Note: Do not modify the linked list. Follo 阅读全文