题目地址：https://leetcode-cn.com/problems/container-with-most-water/ 解题思路: 很明显这类题目不能用暴力，很容易超时；可以采用贪心的想法：最大的体积肯定要么很宽，要么很高。所以从两边开始计算，然后较小的边界舍去，边界向左或者向右移动一个， ...
分类：
其他好文 时间：
2020-07-20 22:25:34
阅读次数：
87
package LeetCode_1060 /** * 1060. Missing Element in Sorted Array * (Prime) * Given a sorted array A of unique numbers, find the K-th missing number s ...
分类：
其他好文 时间：
2020-07-19 00:49:27
阅读次数：
93
用循环依次对list中的每个名字打印出 Hello, xxx! L = ['Bart', 'Lisa', 'Adam']x = len(L) for i in range(x): print('Hello,', L[i]) 此处，若直接使用 for i in x 时，编译报错：TypeError: ...
分类：
编程语言 时间：
2020-07-18 22:45:27
阅读次数：
95
China and Buddhism By far the most important gift that China received from India was neither cotton, nor sugar, nor the knowledge of saltpeter, but a ...
分类：
其他好文 时间：
2020-07-18 15:35:38
阅读次数：
83
Part1 Of all the changes that have taken place in English-language newspapers during the past quarter-century, perhaps the most far-reaching has been ...
分类：
其他好文 时间：
2020-07-16 11:45:14
阅读次数：
85
论文链接：https://arxiv.org/pdf/1701.08546.pdf 先上个大图吸引眼球 关于model generation：Assisted generation:In most of the cases domain knowledge is partially availabl ...
分类：
其他好文 时间：
2020-07-15 23:01:06
阅读次数：
71
Given an array nums with n integers, your task is to check if it could become non-decreasing by modifying at most 1 element. We define an array is non ...
分类：
其他好文 时间：
2020-07-15 01:12:51
阅读次数：
60
在使用YOLO v5进行自己数据集的训练的时候（python3 train.py），报了如下的错误： Traceback (most recent call last): File "train.py", line 402, in <module> tb_writer = SummaryWriter ...
##题面 Problem Description Queues and Priority Queues are data structures which are known to most computer scientists. The Queue occurs often in our dai ...
分类：
其他好文 时间：
2020-07-12 17:05:48
阅读次数：
132
Danny, the local Math Maniac, is fascinated by circles, Omkar's most recent creation. Help him solve this circle problem! You are given \(n\) nonnegat ...
分类：
其他好文 时间：
2020-07-12 10:23:13
阅读次数：
122
