benmo's recent timeline updates
benmo

benmo

V2EX member #259071, joined on 2017-10-12 09:53:02 +08:00
benmo's recent replies
发邮箱: [email protected]
一般通过面试会在 3 天内给回复呢~你叫啥名字,我帮你问下结果
Apr 22, 2020
Replied to a topic by benmo 酷工作 NODEJS 开发(web 后端)
[杭州个推] 具体地址:西湖区西斗门路 福地创业园
Mar 22, 2019
Replied to a topic by dxhuii 问与答 bootcdn 又双叒叕挂了 301 到 cdnjs
@houlin https://cdn.baomitu.com 试试这个,其他相关帖子有说~
Mar 22, 2019
Replied to a topic by huangama 问与答 www.bootcdn.cn 又挂了?
@huangama 早上发现的问题,然后果断换掉~
Mar 22, 2019
Replied to a topic by dxhuii 问与答 bootcdn 又双叒叕挂了 301 到 cdnjs
@houlin 换吧。。。
Mar 22, 2019
Replied to a topic by gary560 分享发现 cdn.bootcss.com 崩了
坑。。。有推荐其他稳定点的 cdn 的吗
// 一个 js 实现
const MINN = 0 ;
const MAXN = 100;
let cnt = 10;
let total = 100;
let res = [];

let l = Math.max(MINN, total - (cnt - 1) * MAXN);
let r = Math.min(MAXN, total - (cnt - 1) * MINN);
let randomNumN = rangeRandom(l, r);
total -= randomNumN;
cnt--;
res.push(randomNumN);
理解楼主的题目,应该是要满足以下条件
@celeron533 的算法对楼主的题目没问题,但如果换一下范围和总和就不一定了吧,比如,范围要求还是[0, 100], 总和要求是 300 呢?如果还按照区间长度 100 划分 10 段,总和显然不是 300,如果按照区间长度是 300 划分 10 段,那么怎么保证每段长度都是[0, 100]?
About   ·   Help   ·   Advertise   ·   Blog   ·   API   ·   FAQ   ·   Solana   ·   2702 Online   Highest 6679   ·     Select Language
创意工作者们的社区
World is powered by solitude
VERSION: 3.9.8.5 · 18ms · UTC 13:54 · PVG 21:54 · LAX 06:54 · JFK 09:54
♥ Do have faith in what you're doing.