chiyeung

[LeetCode&Python] Problem 589. N-ary Tree Preorder Traversal

摘要： Given an n-ary tree, return the preorder traversal of its nodes' values. For example, given a 3-ary tree: Return its preorder traversal as: [1,3,5,6,2 阅读全文

posted @ 2018-10-05 11:21 chiyeung 阅读(135) 评论(0) 推荐(0)

[LeetCode&Python] Problem 559. Maximum Depth of N-ary Tree

摘要： Given a n-ary 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 le 阅读全文

posted @ 2018-10-03 12:56 chiyeung 阅读(120) 评论(0) 推荐(0)

[LeetCode&Python] Problem 590. N-ary Tree Postorder Traversal

摘要： Given an n-ary tree, return the postorder traversal of its nodes' values. For example, given a 3-ary tree: Return its postorder traversal as: [5,6,3,2 阅读全文

posted @ 2018-09-30 11:39 chiyeung 阅读(130) 评论(0) 推荐(0)

[LeetCode&Python] Problem 811. Subdomain Visit Count

摘要： A website domain like "discuss.leetcode.com" consists of various subdomains. At the top level, we have "com", at the next level, we have "leetcode.com 阅读全文

posted @ 2018-09-29 12:29 chiyeung 阅读(94) 评论(0) 推荐(0)

[LeetCode&Python] Problem 476. Number Complement

摘要： Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation. Note: Example 1: Exa 阅读全文

posted @ 2018-09-28 12:30 chiyeung 阅读(136) 评论(0) 推荐(0)

[LeetCode&Python] Problem 557. Reverse Words in a String III

摘要： Given a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order. E 阅读全文

posted @ 2018-09-27 11:50 chiyeung 阅读(138) 评论(0) 推荐(0)

[LeetCode&Python] Problem 806. Number of Lines To Write String

摘要： We are to write the letters of a given string S, from left to right into lines. Each line has maximum width 100 units, and if writing a letter would c 阅读全文

posted @ 2018-09-27 11:40 chiyeung 阅读(262) 评论(0) 推荐(0)

[LeetCode&Python] Problem 876. Middle of the Linked List

摘要： Given a non-empty, singly linked list with head node head, return a middle node of linked list. If there are two middle nodes, return the second middl 阅读全文

posted @ 2018-09-26 15:41 chiyeung 阅读(238) 评论(0) 推荐(0)

[LeetCode&Python] Problem 908. Smallest Range I

摘要： Given an array A of integers, for each integer A[i] we may choose any x with -K <= x <= K, and add xto A[i]. After this process, we have some array B. 阅读全文

posted @ 2018-09-25 12:21 chiyeung 阅读(218) 评论(0) 推荐(0)

[LeetCode&Python] Problem 867. Transpose Matrix

摘要： Given a matrix A, return the transpose of A. The transpose of a matrix is the matrix flipped over it's main diagonal, switching the row and column ind 阅读全文

posted @ 2018-09-25 11:53 chiyeung 阅读(137) 评论(0) 推荐(0)

公告

导航