通过key的hashCode值和数组的长度进行 & 运算 @param key @return

Inserts a word into the trie.

Inserts a word into the trie. */

Adds an item at the front of Deque. Return true if the operation is successful.

Checks whether the circular deque is full or not.

删除某个节点(调用方需保证 Node x 存在) @param x

leetcode - https://leetcode-cn.com/problems/rotate-array/

反转的思路是根据中间为轴，对称交换

交换功能 @param nums 数组 @param startIndex 传入想要交换的前索引 @param endIndex 传入想要交换的后索引

反转 @param nums @param start @param end

** 反转数组 */

将数组中的一段反转

Returns if the word is in the trie.

Returns if the word is in the trie.

Returns if the word is in the trie. */

:type nums: List[int] :type target: int :rtype: int

** Initialize your data structure here. Set the size of the deque to be k. */

** Adds an item at the front of Deque. Return true if the operation is successful. */

** Checks whether the circular deque is full or not. */

** Checks whether the circular deque is full or not. */

加入链表头部 @param x

添加节点 @param doubleNode