欢迎来到PJCK的博客

随笔分类 -  STL----其他

vector
摘要:Return any binary tree that matches the given preorder and postorder traversals. Values in the traversals pre and post are distinct positive integers. 阅读全文
posted @ 2019-04-26 10:35 PJCK 阅读(200) 评论(0) 推荐(0)
摘要:Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. For example, 阅读全文
posted @ 2019-04-26 09:12 PJCK 阅读(152) 评论(0) 推荐(0)
摘要:Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. For example, 阅读全文
posted @ 2019-04-26 09:09 PJCK 阅读(187) 评论(0) 推荐(0)
摘要:Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]). Y 阅读全文
posted @ 2019-04-23 20:07 PJCK 阅读(379) 评论(0) 推荐(0)
摘要:A peak element is an element that is greater than its neighbors. Given an input array nums, where nums[i] ≠ nums[i+1], find a peak element and return 阅读全文
posted @ 2019-04-23 19:01 PJCK 阅读(155) 评论(0) 推荐(0)
摘要:Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. Your algorithm's runtime com 阅读全文
posted @ 2019-04-23 18:06 PJCK 阅读(100) 评论(0) 推荐(0)
摘要:Write a function that reverses a string. The input string is given as an array of characters char[]. Do not allocate extra space for another array, yo 阅读全文
posted @ 2019-04-19 20:47 PJCK 阅读(122) 评论(0) 推荐(0)
摘要:Given a binary tree, return the preorder traversal of its nodes' values. Example: Follow up: Recursive solution is trivial, could you do it iterativel 阅读全文
posted @ 2019-04-17 18:43 PJCK 阅读(174) 评论(0) 推荐(0)
摘要:Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. Example 阅读全文
posted @ 2019-04-17 08:07 PJCK 阅读(129) 评论(0) 推荐(0)
摘要:Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example:Given binary tree [3 阅读全文
posted @ 2019-04-17 08:02 PJCK 阅读(112) 评论(0) 推荐(0)
摘要:You need to find the largest value in each row of a binary tree. Example: 阅读全文
posted @ 2019-04-16 12:48 PJCK 阅读(104) 评论(0) 推荐(0)
摘要:690. Employee Importance Easy 377369FavoriteShare 690. Employee Importance Easy 377369FavoriteShare Easy You are given a data structure of employee in 阅读全文
posted @ 2019-04-15 20:33 PJCK 阅读(129) 评论(0) 推荐(0)
摘要:Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacen 阅读全文
posted @ 2019-04-15 19:47 PJCK 阅读(147) 评论(0) 推荐(0)
摘要:We are given head, the head node of a linked list containing unique integer values. We are also given the list G, a subset of the values in the linked 阅读全文
posted @ 2019-04-14 12:47 PJCK 阅读(150) 评论(0) 推荐(0)
摘要:International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows: "a" maps to ".-", "b"maps 阅读全文
posted @ 2019-04-12 09:05 PJCK 阅读(111) 评论(0) 推荐(0)
摘要:1005 继续(3n+1)猜想 (25 分) 卡拉兹(Callatz)猜想已经在1001中给出了描述。在这个题目里,情况稍微有些复杂。 当我们验证卡拉兹猜想的时候,为了避免重复计算,可以记录下递推过程中遇到的每一个数。例如对 n=3 进行验证的时候,我们需要计算 3、5、8、4、2、1,则当我们对  阅读全文
posted @ 2019-03-23 17:38 PJCK 阅读(495) 评论(0) 推荐(0)
摘要:Given two sequences pushed and popped with distinct values, return true if and only if this could have been the result of a sequence of push and pop o 阅读全文
posted @ 2019-03-23 09:43 PJCK 阅读(94) 评论(0) 推荐(0)
摘要:You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1' 阅读全文
posted @ 2019-03-22 21:23 PJCK 阅读(183) 评论(0) 推荐(0)
摘要:You're now a baseball game point recorder. Given a list of strings, each string can be one of the 4 following types: Each round's operation is permane 阅读全文
posted @ 2019-03-22 20:07 PJCK 阅读(146) 评论(0) 推荐(0)