题目分析定义两个状态变量: buy_profit: 若i-1天，持有股票，最大利润是 $(buy_profit) sell_profit: 若i-1天，卖出股票, 最大利润是 $(sell_profit) 买卖利润情况：最开始: i == 0; int buy_pro ...

413. Arithmetic Slices这道题，简而言之，求数组里，等差序列的个数。 比如 123A = [1, 2, 3, 4]有3个等差数列[1, 2, 3], [2, 3, 4], [1, 2, 3, 4] 题目没有说明A是等差数列，所以也要考虑A不是等差数列，但是其子数组是等 ...

Reactoron能改善React Native开发体验。

Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell.

题意:notepad里只有一个’A’字符串。 只能允许两个操作: Copy All: 把notepad里所有的字符串copy Paste: 复制上次copy的内容 问，最少的步骤（copy & paste) 能生成n个’A’ 分析可以发现规律: n op cur cha ...

GauGAN: Changing Sketches into Photorealistic Masterpieces 3月的时候，英伟达发布了一个视频挺火的： 你只要粗略勾勒简单的线条，AI就能生成逼真的写实图片。

Load WeightsFirst, see this C library function: 1size_t fread ( void * ptr, size_t size, size_t count, FILE * stream ); Parameters ptr − Pointe ...

Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.

Flatten the list so that all the nodes appear in a single-level, doubly linked list. You are given the head of the first level of the list.

Let’s firstly see how Darknet construct a neural network. See at detector.c test_detector function, it construct a network by parsing the xxx.cfg file and xxx.weights file. In my case, they are yolo3-tiny.cfg and yolo3-tiny.weights