摘要: Description: Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). Link: 102. Binary T 阅读全文
posted @ 2021-01-13 18:25 summer_mimi 阅读(57) 评论(0) 推荐(0) 编辑
摘要: Description: Given a (singly) linked list with head node root, write a function to split the linked list into k consecutive linked list "parts". The l 阅读全文
posted @ 2020-12-08 09:08 summer_mimi 阅读(81) 评论(0) 推荐(0) 编辑
摘要: Description: You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their 阅读全文
posted @ 2020-12-03 20:42 summer_mimi 阅读(50) 评论(0) 推荐(0) 编辑
摘要: Description: Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node numbe 阅读全文
posted @ 2020-12-03 20:09 summer_mimi 阅读(52) 评论(0) 推荐(0) 编辑
摘要: Description: Write a function to delete a node in a singly-linked list. You will not be given access to the head of the list, instead you will be give 阅读全文
posted @ 2020-12-01 16:09 summer_mimi 阅读(65) 评论(0) 推荐(0) 编辑
摘要: Description: Given a singly linked list, determine if it is a palindrome. Link: https://leetcode.com/problems/palindrome-linked-list/ Examples: Exampl 阅读全文
posted @ 2020-12-01 16:00 summer_mimi 阅读(59) 评论(0) 推荐(0) 编辑
摘要: Description: Remove all elements from a linked list of integers that have value val. Link: https://leetcode.com/problems/remove-linked-list-elements/ 阅读全文
posted @ 2020-12-01 15:11 summer_mimi 阅读(46) 评论(0) 推荐(0) 编辑
摘要: Description: Write a program to find the node at which the intersection of two singly linked lists begins. Link: https://leetcode.com/problems/interse 阅读全文
posted @ 2020-12-01 14:59 summer_mimi 阅读(39) 评论(0) 推荐(0) 编辑
摘要: Description: Sort a linked list using insertion sort. Algorithm of Insertion Sort: Insertion sort iterates, consuming one input element each repetitio 阅读全文
posted @ 2020-11-28 13:39 summer_mimi 阅读(43) 评论(0) 推荐(0) 编辑
摘要: Description: Given a singly linked list L: L0→L1→…→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You may not modify the values in the list's nodes, 阅读全文
posted @ 2020-11-28 12:05 summer_mimi 阅读(116) 评论(0) 推荐(0) 编辑