FreeCodeCamp Caesars密码项目的演练

Project 3 from JavaScript Algos and DS Certification.

JavaScript Algos和DS认证的Project 3。

We're continuing our journey through the FreeCodeCamp JavaScript Algorithms and Data Structures Certification! Last project was the Roman Numeral Converter, the second entry in our series. You can check it out here.

我们正在继续通过FreeCodeCamp JavaScript算法和数据结构认证的旅程！ 最后一个项目是Roman Numeral Converter ，这是我们系列中的第二个条目。 您可以在这里查看 。

Now we're doing the Caesars Cipher. Our job is to take a ROT13-encoded string and return it as a decoded string.

现在我们正在做Caesars Cipher 。 我们的工作是获取ROT13编码的字符串，并将其作为解码后的字符串返回。

This video covers:

该视频涵盖：

• What Caesar Ciphers are
  什么是凯撒密码
• What ROT13 Ciphers are
  什么是ROT13密码
• How to encode and decode strings using ciphers
  如何使用密码编码和解码字符串
• What accumulators are (useful for later JavaScript)
  什么是累加器(对以后JavaScript有用)
• An efficient solution with linear runtime O(n)
  具有线性运行时间O(n)的有效解决方案
• and more!
  和更多！

You can watch the full video on my YouTube channel.

您可以在我的YouTube频道上观看完整视频 。

Here's a link to the entire playlist as well.

这也是指向整个播放列表的链接。

翻译自: https://www.freecodecamp.org/news/a-walkthrough-of-the-freecodecamp-caesars-cipher-project/