Javascript(leetcode#22) Generate Parentheses

發表於 2022-08-02 更新於 2022-08-30 分類於 Leetcode ， Leetcode Medium Disqus：

Difficult:Medium

題目

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.

發表於 2022-08-02 更新於 2022-08-30 分類於 Leetcode ， Leetcode Easy Disqus：

Difficult:Easy

You are given the heads of two sorted linked lists list1 and list2.

Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists.

Return the head of the merged linked list.

發表於 2022-08-02 更新於 2022-08-30 分類於 Leetcode ， Leetcode Easy Disqus：

Difficult:Easy

Given a string s containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[‘ and ‘]’, determine if the input string is valid.

An input string is valid if:

Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order.

發表於 2022-08-02 更新於 2022-08-30 分類於 Leetcode ， Leetcode Medium Disqus：

Difficult:Medium

Given the head of a linked list, remove the nth node from the end of the list and return its head.

發表於 2022-08-02 更新於 2022-08-30 分類於 Leetcode ， Leetcode Medium Disqus：

Difficult:Medium

Given an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that:

0 <= a, b, c, d < n
a, b, c, and d are distinct.
nums[a] + nums[b] + nums[c] + nums[d] == target
You may return the answer in any order.