Given the head of a linked list, remove the nth node from the end of the list and return its head.
Follow up: Could you do this in one pass?Example:
Input: head = [1,2,3,4,5], n = 2
Output: [1,2,3,5]本題給定一個鏈結串列（Linked List），而我們要做的，便是將倒數第 n 個元素刪除，並回傳刪除後的 Linked List。
Read More »LeetCode: 19-Remove Nth Node From End of List 解題紀錄 Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.
Notice that the solution set must not contain duplicate quadruplets.Example:
Input: nums = [1,0,-1,0,-2,2], target = 0
Output: [[-2,-1,1,2],[-2,0,0,2],[-1,0,0,1]]這個題目是 2Sum、3Sum 的衍伸版，同樣給定一個整數陣列輸入，我們要找出由四個數加總為 0 的所有組合。
Read More »LeetCode: 18-4Sum 解題紀錄 Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.Example:
Input: s = "(()"
Output: 2
Explanation: The longest valid parentheses substring is "()".
Input: s = ")()())"
Output: 4
Explanation: The longest valid parentheses substring is "()()".這個題目輸入一個只由 '(' 或是 ')' 組成的字串，而我們要做的，就是判斷最長的『合理』子字串長度。
比方說， "()" 就是合理的子字串、")(" 就是個不合理的子字串。
Read More »LeetCode: 32-Longest Valid Parentheses 解題紀錄 Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.Example:
Input: nums = [-1,2,1,-4], target = 1
Output: 2
Explanation: The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).Constraints:
3 <= nums.length <= 10^3-10^3 <= nums[i] <= 10^3-10^4 <= target <= 10^4這個題目跟 15 題非常相似，同樣是給定一組整數陣列輸入，不過還多給了一個目標值 target。我們需要找出 3 個數值，使其加總值越接近 target 越好。
需要注意的是，我們要返回的並不是找到的陣列，而是直接返回最接近 target 的數值。
Read More »LeetCode: 16-3Sum Closest 解題紀錄 Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
Notice that the solution set must not contain duplicate triplets.Example:
Input: nums = [-1,0,1,2,-1,-4]
Output: [[-1,-1,2],[-1,0,1]]
Input: nums = []
Output: []題目是給定一個全是由『整數』組成的陣列，而我們的目標就是要找出『任意三個數值加總為 0 的所有答案』，也是題目 3Sum 的意義。
還有，返回的結果不能有重複的答案。
Read More »LeetCode: 15-3Sum 解題紀錄 Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.
If such an arrangement is not possible, it must rearrange it as the lowest possible order (i.e., sorted in ascending order).
The replacement must be in place and use only constant extra memory.Example:
Input: nums = [1,2,3]
Output: [1,3,2]
Input: nums = [3,2,1]
Output: [1,2,3]
Input: nums = [1,1,5]
Output: [1,5,1]
Input: nums = [1]
Output: [1]題目給定輸入一個陣列，我們要將陣列排列成『下一個較大的值』。比方說題目輸入了 [1,2,3]，那麼我們就不能排列成 [3,1,2]、而是要排列成 [1,3,2] —— 因為 132 才下一個較大的值，而非 312。
而當題目給定的陣列沒有下一個較大的排列時，則將陣列『從小排到大』。
順帶一提這題不會返回任何值，直接處理輸入陣列即可。
Read More »LeetCode: 31-Next Permutation 解題紀錄 Merge two sorted linked lists and return it as a sorted list. The list should be made by splicing together the nodes of the first two lists.
Example:
Input: l1 = [1,2,4], l2 = [1,3,4]
Output: [1,1,2,3,4,4]題目輸入兩個已經排序過的 Linked List，而我們要將其『合併』，並回傳同樣排序過的 Linked List。
Read More »LeetCode: 21-Merge Two Sorted Lists 解題紀錄 Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.Symbol Value
I 1
V 5
X 10
L 50
C 100
D 500
M 1000For example, 2 is written as II in Roman numeral, just two one's added together. 12 is written as XII, which is simply X + II. The number 27 is written as XXVII, which is XX + V + II.
Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:I can be placed before V (5) and X (10) to make 4 and 9. X can be placed before L (50) and C (100) to make 40 and 90. C can be placed before D (500) and M (1000) to make 400 and 900.Given a roman numeral, convert it to an integer.Example:
Input: s = "LVIII"
Output: 58
Explanation: L = 50, V= 5, III = 3.
Input: s = "MCMXCIV"
Output: 1994
Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.
Notice that you may not slant the container.Example:
Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.這個題目也是相當地經典，就是題目給定一陣列，陣列內為由左到右每個 ...... ㄜ，這裡就叫『木板』好了，每個木板的高度。
而不同的木板之間，距離單位都是 1。我們要做的就是，找出能讓容器積蓄最多的水兩片木板，最後，回傳可以積蓄水的最大值。
Read More »LeetCode: 11-Container With Most Water 解題紀錄