摘要:
【064-Minimum Path Sum(最小路径和)】 【LeetCode-面试算法经典-Java实现】【全部题目文件夹索引】 原题 Given a m x n grid filled with non-negative numbers, find a path from top left to 阅读全文
摘要:
SI SO应该对调过来用。。 TX /* ** Tx.c ** Transmit test program for PIC18F4520 and nRF24L01 or nRF24L01+ ** Uses the Microchip C18 compiler ** Based on SFE code 阅读全文
摘要:
Greedy. 证明: Let's say we have job 1, 2, ..., n, and they have time and fine as t1, f1, t2, f2, ..., tn, fn and they are in the order of t1/f1 <= t2/f2 阅读全文