欢迎来到PJCK的博客

上一页 1 2 3 4 5 6 7 8 9 10 ··· 15 下一页
摘要: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 阅读(33) 评论(0) 推荐(0) 编辑
摘要:You need to find the largest value in each row of a binary tree. Example: 阅读全文
posted @ 2019-04-16 12:48 PJCK 阅读(22) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, find the leftmost value in the last row of the tree. Example 1: Example 2: Note: You may assume the tree (i.e., the given root no 阅读全文
posted @ 2019-04-16 12:28 PJCK 阅读(26) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest l 阅读全文
posted @ 2019-04-16 09:24 PJCK 阅读(54) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest l 阅读全文
posted @ 2019-04-16 09:20 PJCK 阅读(43) 评论(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 阅读(28) 评论(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 阅读(36) 评论(0) 推荐(0) 编辑
摘要:输入一个字符串Str,输出Str里最长回文子串的长度。 回文串:指aba、abba、cccbccc、aaaa这种左右对称的字符串。 串的子串:一个串的子串指此(字符)串中连续的一部分字符构成的子(字符)串例如 abc 这个串的子串:空串、a、b、c、ab、ac、bc、abc 收起 输入一个字符串St 阅读全文
posted @ 2019-04-15 17:58 PJCK 阅读(50) 评论(0) 推荐(0) 编辑
摘要:You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contai 阅读全文
posted @ 2019-04-14 13:07 PJCK 阅读(31) 评论(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 阅读(48) 评论(0) 推荐(0) 编辑
摘要:Given a linked list, return the node where the cycle begins. If there is no cycle, return null. To represent a cycle in the given linked list, we use 阅读全文
posted @ 2019-04-14 11:22 PJCK 阅读(53) 评论(0) 推荐(0) 编辑
摘要:Given a linked list, remove the n-th node from the end of list and return its head. Example: Note: Given n will always be valid. Follow up: Could you 阅读全文
posted @ 2019-04-14 11:17 PJCK 阅读(26) 评论(0) 推荐(0) 编辑
摘要:Given a linked list, swap every two adjacent nodes and return its head. You may not modify the values in the list's nodes, only nodes itself may be ch 阅读全文
posted @ 2019-04-14 10:29 PJCK 阅读(61) 评论(0) 推荐(0) 编辑
摘要:Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the 阅读全文
posted @ 2019-04-14 09:59 PJCK 阅读(22) 评论(0) 推荐(0) 编辑
摘要:Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists: begin to in 阅读全文
posted @ 2019-04-14 09:53 PJCK 阅读(45) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 8 9 10 ··· 15 下一页