原題鏈接在這里：https://leetcode.com/problems/word-ladder/ leetcode70。題目： Given two words (beginWord?and?endWord), and a dictionary's word list, find the length of shortest transformation sequence from?beginWord?to?endWord, such that:

Leetcode ?448. Find All Numbers Disappeared in an Array Add to List Description?Submission?Solutions Total Accepted:?31266Total Submissions:?58997Difficulty:?EasyContributors:?yuhaowang001 ? Given an array of integers where 1 ≤ a[i] ≤?n?(n?= size of

原題 TinyURL is a URL shortening service where you enter a URL such as https://leetcode.com/problems/design-tinyurl and it returns a short URL such as http://tinyurl.com/4e9iAk. Design the encode and decode methods for the TinyURL service. There is no res

106. Convert Sorted List to Binary Search Tree/109. Convert Sorted List to Binary Search Tree 本題難度: Medium/EasyTopic: Linked ListDescription A linked list is given such that each node contains an additional random pointer which could point to any node

題目 Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes. You should try to do it in place. The program should run in O(1) space complexi

93. 復原IP地址 給定一個只包含數字的字符串，復原它并返回所有可能的 IP 地址格式。 LEETCODE、輸入"010010" 輸出["0.10.0.10","0.100.1.0"] 思路 ①字符串長度為[4,12]符合條件，然后將小數點遍歷，找出p1,p2,p3,p4的值[0,255]符

題目：Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space for another array, you must do this in place with constant memory. leetcode70。 For example, Gi

Given a singly linked list?L:?L0→L1→…→Ln-1→Ln,reorder it to:?L0→Ln→L1→Ln-1→L2→Ln-2→… You must do this in-place without altering the nodes' values. leetcode121？For example,Given?{1,2,3,4}, reorder it to?{1,4,2,3}. ? 看上去有點難，實際

Given two strings s and t, write a function to determine if t is an anagram of s. For example, s = “anagram”, t = “nagaram”, return true. s = “rat”, t = “car”, return false. Note: You may assume the string contains only lowercase

Given a linked list, return the node where the cycle begins. If there is no cycle, return null. 分析： 假设这个链表如图所示，链表长度为L，相遇点是6节点，起始点到环开始点距离为a，环开始点到相遇点距离为x。设慢指针速度为1，