Skip to content
New issue

Have a question about this project? # for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “#”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? # to your account

stackoverflow该译名啥? #7

Open
englianhu opened this issue Aug 26, 2024 · 0 comments
Open

stackoverflow该译名啥? #7

englianhu opened this issue Aug 26, 2024 · 0 comments

Comments

@englianhu
Copy link
Contributor

englianhu commented Aug 26, 2024

秦谏启奏

与预期出入/代码有误

操作系统信息

$ neofetch
#R> devtools::session_info()
#R> Sys.info()

原本预期结果

提案

文献与案例

基本概念

泛型栈(Stack)

  • 栈是一种后进先出(LIFO, Last In First Out)的数据结构。栈中最后添加的元素最先被移除。可以把栈想象成一叠盘子,最后放上去的盘子最先被拿走。

泛型队列(Queue)

  • 队列是一种先进先出(FIFO, First In First Out)的数据结构。队列中第一个添加的元素最先被移除。可以把队列想象成排队买票,最先排队的人最先买到票。

出处:泛型栈(Stack)和泛型队列(Queue)

根据以上「泛型栈」诠释为毫无节制、刻舟求剑、海底捞月、治标不治本,可译为「栈滥」最为恰当,借鉴苹果公司一条龙服务产品、孙玉芳教授之名言和愚生目前自修并科研咱们世袭制道教自然对数大秦赋算筹,那些使用它人产品或没有釜底抽薪,一劳永逸的门面功夫。

  • 方案一:栈滥
  • 方案二:栈涝
  • 方案三:栈氾
  • 方案四:栈涔

众卿商议

结论

众方案

  • 方案一:
  • 方案二:
  • 方案三:

最优方案

相关奏折

# for free to join this conversation on GitHub. Already have an account? # to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant