BitTorrent协议(一)之解析种子文件
发表于
更新于
宏扩展的执行逻辑初探(二)
发表于
更新于
宏扩展的执行逻辑初探(一)
发表于
更新于
[leetcode 352]原创解法
发表于
更新于
题目概述
Given a data stream input of non-negative integers a1, a2, …, an, …, summarize the numbers seen so far as a list of disjoint intervals.
For example, suppose the integers from the data stream are 1, 3, 7, 2, 6, …, then the summary will be:
[1, 1] [1, 1], [3, 3] [1, 1], [3, 3], [7, 7] [1, 3], [7, 7] [1, 3], [6, 7]
[leetcode 341]练练手
发表于
更新于
[leetcode 337]打败了100%的解法
发表于
更新于
题目概述
The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each house has one and only one parent house. After a tour, the smart thief realized that "all houses in this place forms a binary tree". It will automatically contact the police if two directly-linked houses were broken into on the same night.
Determine the maximum amount of money the thief can rob tonight without alerting the police.
1 | Example 1: |
从大文件中找到出现次数最多的10个数
发表于
更新于
[leetcode 312]Burst Balloons原创解法
发表于
更新于
题目概述
Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloons. If the you burst balloon i you will get nums[left] * nums[i] * nums[right] coins. Here left and right are adjacent indices of i. After the burst, the left and right then becomes adjacent.
Find the maximum coins you can collect by bursting the balloons wisely.
examples:
nums = [3,1,5,8] --> [3,5,8] --> [3,8] --> [8] --> []
coins = 3*1*5 + 3*5*8 + 1*3*8 + 1*8*1 = 167
How to resize VirtualBox fixed image size and keep contents unchanged ?
发表于
更新于