npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2026 – Pkg Stats / Ryan Hefner

luohao-data-structure

v1.0.8

Published

数据结构和算法

Readme

记录在实际项目中遇到的一些数据结构和算法问题 当一个问题看起来很复杂的时候,你需要问自己,到底是这个问题本身很复杂,还是表达这个问题的方式存在问题。如果换一种表现形式,问题是不是会以一种比较清晰的方式展示在我面前。

tree

  • 将线性数据转化成树状数据

stack

  • 将中缀表达式转换成后缀表达式
  • 求解后缀算术表达式的值

将中缀表达式转换成后缀表达式

后缀表达式的特点

  • 操作符置于操作数的后面。
  • 不需要括号,也不需要定义优先级,只需要从左往右计算就行。

熟悉调度场算法