2020年9月17日
[LeetCode] 1110. Delete Nodes And Return Forest
摘要： Given the root of a binary tree, each node in the tree has a distinct value. After deleting all nodes with a value in to_delete, we are left with a fo 阅读全文
posted @ 2020-09-17 15:02 CNoodle 阅读(211) 评论(0) 推荐(0)
[LeetCode] 421. Maximum XOR of Two Numbers in an Array
摘要： Given an integer array nums, return the maximum result of nums[i] XOR nums[j], where 0 <= i <= j < n. Example 1: Input: nums = [3,10,5,25,2,8] Output: 阅读全文
posted @ 2020-09-17 13:12 CNoodle 阅读(269) 评论(0) 推荐(0)
[LeetCode] 1109. Corporate Flight Bookings
摘要： There are n flights that are labeled from 1 to n. You are given an array of flight bookings bookings, where bookings[i] = [firsti, lasti, seatsi] repr 阅读全文
posted @ 2020-09-17 08:08 CNoodle 阅读(376) 评论(0) 推荐(0)