01 2019 档案

摘要:Description On a table are cards, with a positive integer printed on the front and back of each card (possibly different). We flip any number of cards 阅读全文
posted @ 2019-01-24 22:11 arcsinW 阅读(293) 评论(0) 推荐(0) 编辑
摘要:Description Given an array of non negative integers, half of the integers in A are odd, and half of the integers are even. Sort the array so that when 阅读全文
posted @ 2019-01-23 22:30 arcsinW 阅读(254) 评论(0) 推荐(0) 编辑
摘要:Description A binary tree is univalued if every node in the tree has the same value. Return true if and only if the given tree is univalued. Example 1 阅读全文
posted @ 2019-01-22 21:39 arcsinW 阅读(146) 评论(0) 推荐(0) 编辑
摘要:Description In a array of size , there are unique elements, and exactly one of these elements is repeated N times. Return the element repeated times. 阅读全文
posted @ 2019-01-21 16:17 arcsinW 阅读(141) 评论(0) 推荐(0) 编辑
摘要:Description Given an array of integers sorted in non decreasing order, return an array of the squares of each number, also in sorted non decreasing or 阅读全文
posted @ 2019-01-21 16:15 arcsinW 阅读(589) 评论(0) 推荐(0) 编辑
摘要:Description Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which m 阅读全文
posted @ 2019-01-21 16:13 arcsinW 阅读(138) 评论(0) 推荐(0) 编辑
摘要:Description Given the root node of a binary search tree (BST) and a value to be inserted into the tree, insert the value into the BST. Return the root 阅读全文
posted @ 2019-01-18 19:43 arcsinW 阅读(158) 评论(0) 推荐(0) 编辑
摘要:Description The Fibonacci numbers , commonly denoted form a sequence, called the Fibonacci sequence , such that each number is the sum of the two prec 阅读全文
posted @ 2019-01-17 20:15 arcsinW 阅读(395) 评论(0) 推荐(0) 编辑
摘要:Description Given the node of a binary search tree, return the sum of values of all nodes with value between and (inclusive). The binary search tree i 阅读全文
posted @ 2019-01-16 21:54 arcsinW 阅读(276) 评论(0) 推荐(0) 编辑