摘要：
Given two arrays arr1 and arr2, the elements of arr2 are distinct, and all elements in arr2 are also in arr1. Sort the elements of arr1 such that the 阅读全文
posted @ 2020-03-11 14:28
CNoodle
阅读(158)
评论(0)
推荐(0)
摘要：
Given an array A of integers, return true if and only if we can partition the array into three non-empty parts with equal sums. Formally, we can parti 阅读全文
posted @ 2020-03-11 12:41
CNoodle
阅读(192)
评论(0)
推荐(0)
摘要：
Implement the BSTIterator class that represents an iterator over the in-order traversal of a binary search tree (BST): BSTIterator(TreeNode root) Init 阅读全文
posted @ 2020-03-11 08:23
CNoodle
阅读(479)
评论(0)
推荐(0)
摘要：
A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are va 阅读全文
posted @ 2020-03-11 05:56
CNoodle
阅读(219)
评论(0)
推荐(0)
摘要：
Design a data structure that supports adding new words and finding if a string matches any previously added string. Implement the WordDictionary class 阅读全文
posted @ 2020-03-11 05:36
CNoodle
阅读(316)
评论(0)
推荐(0)
摘要：
Serialization is converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted acr 阅读全文
posted @ 2020-03-11 02:16
CNoodle
阅读(243)
评论(0)
推荐(0)
浙公网安备 33010602011771号