awesome-repositories.com
博客
MCP
awesome-repositories.com

通过 AI 驱动的搜索，发现最优秀的开源仓库。

探索精选搜索开源替代品自托管软件博客网站地图
项目MCP 服务器关于排名机制媒体报道
法律隐私政策服务条款
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

1 个仓库

Awesome GitHub RepositoriesMaximum Absolute Subarray Sum Calculators

Algorithms that find the maximum absolute value of any subarray sum using prefix sums.

Distinct from Maximum Subarray Sums: Distinct from Maximum Subarray Sums: computes the maximum absolute value, not just the largest positive sum.

Explore 1 awesome GitHub repository matching scientific & mathematical computing · Maximum Absolute Subarray Sum Calculators. Refine with filters or upvote what's useful.

  1. Home
  2. Scientific & Mathematical Computing
  3. Subarray Sum Algorithms
  4. Minimum Length Subarray Sums
  5. Contiguous Subarray Processing
  6. Maximum Subarray Sums

Awesome Maximum Absolute Subarray Sum Calculators GitHub Repositories

用 AI 发现最棒的仓库。我们将通过 AI 为您搜索最匹配的仓库。
  • sharingsource/logicstack-leetcodeSharingSource 的头像

    SharingSource/LogicStack-LeetCode

    7,495在 GitHub 上查看↗

    LogicStack-LeetCode is a curated repository of solved algorithm problems and data structure implementations, primarily drawn from the LeetCode platform. Its core identity is a structured collection of solutions designed to support technical interview preparation and competitive programming practice, with each solution accompanied by complexity analyses to help engineers understand performance trade-offs. The repository distinguishes itself through its breadth of coverage across fundamental algorithmic patterns and data structures. It includes implementations for array manipulation, string pro

    Uses prefix sums to find the maximum absolute value of any subarray sum.

    algorithminterview-practiceinterview-questions
    在 GitHub 上查看↗7,495
  • Maximum Absolute Subarray Sum Calculators