使用python+adb实现微信跳一跳外挂

## Description

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.

k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.

You may not alter the values in the nodes, only nodes itself may be changed.Only constant memory is allowed.

For example,Given this linked list:

`1->2->3->4->5`

For k = 2, you should return:

`2->1->4->3->5`

For k = 3, you should return:

`3->2->1->4->5`

## Description

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.

将k个有序链表合并为一个链表

## Description

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

For example, given n = 3, a solution set is:

`[ "((()))", "(()())", "(())()", "()(())", "()()()" ]`

给出n组括号，生成所有正确的匹配组合

## Description

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

将两个有序链表合二为一

## Description

Given a string containing just the characters

`'('`

,`')'`

,`'{'`

,`'}'`

,`'['`

and`']'`

, determine if the input string is valid.

The brackets must close in the correct order,`"()"`

and`"()[]{}"`

are all valid but`"(]"`

and`"([)]"`

are not.

给出包含三种括号的字符串，验证括号是否左右匹配