- 博客(2)
- 收藏
- 关注
RSS订阅原创 Leetcode简单 乞丐问题 English beggars(JS)
刷题系列Born a misinterpretation of this kata, your task here is pretty simple: given an array of values and an amount of beggars, you are supposed to return an array with the sum of what each beggar brings home, assuming they all take regular turns, from the
2021-04-14 04:08:03
463
原创 leetcode53 最大子数列之和Maximum subarray sum(JS)
@[TOC](leetcode53 最大子数列之和Maximum subarray sum(JS))刷题系列The maximum sum subarray problem consists in finding the maximum sum of a contiguous subsequence in an array or list of integers:maxSequence([-2, 1, -3, 4, -1, 2, 1, -5, 4])// should be 6: [4, -1, 2
2021-04-11 05:08:22
243
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人