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

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

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

5 个仓库

Awesome GitHub RepositoriesPostfix Expression Evaluators

Processes a sequence of tokens representing an arithmetic expression in postfix notation using a stack to compute the result.

Distinct from Notation Converters: Distinct from Notation Converters: focuses on evaluating postfix expressions, not converting between notations.

Explore 5 awesome GitHub repositories matching software engineering & architecture · Postfix Expression Evaluators. Refine with filters or upvote what's useful.

Awesome Postfix Expression Evaluators GitHub Repositories

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

    greyireland/algorithm-pattern

    15,465在 GitHub 上查看↗

    This project is an algorithm template library and coding interview study guide providing reusable code patterns for common data structures and algorithms. It serves as a reference for optimized strategies and a structured learning path to build proficiency in algorithmic problem solving and competitive programming. The library focuses on standardized implementations of key algorithmic patterns, including sliding windows, backtracking, dynamic programming, and binary search. It provides specific templates for managing binary search trees, searching rotated sorted arrays, and executing divide-a

    Provides a stack-based evaluator for arithmetic expressions in reverse polish notation.

    Goalgoalgorithmleetcode
    在 GitHub 上查看↗15,465
  • chefyuan/algorithm-basechefyuan 的头像

    chefyuan/algorithm-base

    10,702在 GitHub 上查看↗

    algorithm-base is an educational library and study guide designed for simulating algorithms and studying data structures. It functions as an execution visualizer that renders step-by-step state changes and pointer updates through animated simulations to illustrate how data movement works. The project distinguishes itself by mapping conceptual logic directly to multi-language source code implementations. It utilizes a comparative analysis framework to evaluate different algorithmic strategies based on stability, time complexity, and space complexity, while organizing problems by underlying mec

    Computes the result of a reverse Polish notation expression by pushing and popping operands.

    algorithmsbaseinterview-practice
    在 GitHub 上查看↗10,702
  • coells/100dayscoells 的头像

    coells/100days

    7,488在 GitHub 上查看↗

    This project is a comprehensive collection of computer science implementations and an algorithm tutorial repository. It serves as a study guide and reference for competitive programming, providing executable code examples that demonstrate fundamental algorithmic problem solving and mathematical computation. The library covers a wide range of specialized domains, including cryptography and security primitives, lossless data compression techniques, and computational geometry for spatial analysis. It also features implementations of machine learning models, linear algebra operations, and formal

    Evaluates mathematical expressions in reverse polish notation using a stack-based approach.

    Jupyter Notebook
    在 GitHub 上查看↗7,488
  • 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

    Evaluates postfix arithmetic expressions using a stack-based algorithm.

    algorithminterview-practiceinterview-questions
    在 GitHub 上查看↗7,495
  • soapyigu/leetcode-swiftsoapyigu 的头像

    soapyigu/LeetCode-Swift

    4,958在 GitHub 上查看↗

    LeetCode-Swift is a collection of algorithm solutions written in Swift, designed for coding interview preparation. Each solution is implemented as a self-contained function with no external dependencies, making it easy to run and test. The repository organizes solutions by topic and company, and every file includes time and space complexity annotations, allowing quick evaluation of algorithmic efficiency. What sets this repository apart is its flat file structure and the way solutions are tagged with the companies that asked them in interviews, enabling targeted practice. All code resides in

    Implements a stack-based evaluator for arithmetic expressions in Reverse Polish Notation.

    Swiftalgorithmdata-structuresinterview
    在 GitHub 上查看↗4,958
  1. Home
  2. Software Engineering & Architecture
  3. Expression Transformers
  4. Notation Converters
  5. Postfix Expression Evaluators