乐凯撒披萨1024程序员节暗号代码

最新推荐文章于 2023-08-10 14:23:36 发布

ChayChan

最新推荐文章于 2023-08-10 14:23:36 发布

阅读量1.7k

点赞数

CC 4.0 BY-SA版权

分类专栏：技术小干货文章标签： 1024程序员节乐凯撒暗号

本文链接：https://blog.csdn.net/Chay_Chan/article/details/109258442

技术小干货专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一种名为LaesarSignal的函数，通过定义一个名为Pizza的类，实现了一个基于特定数值输入的加密和解密过程。利用数学序列和字母映射，展示了如何根据给定的666值生成加密序列并进行解密，涉及的关键词包括序列排序、加密算法和字母表替换。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

在这里插入图片描述

function laesarSignal() {
        class Pizza {
            constructor(yours) {
                this.yours = yours;
                this.sequence = [1, 2, 3, 4, 5, 6, 7, 8, 9].map(n => Math.pow(2, n))
                    .sort((a, b) => a > b ? -1 : (a < b) ? 1 : 0);
                this.cipher = [];
            }

            getCipher() {
                this.sequence.reduce((total, piece) => {
                    if (total + piece > this.yours) return total;
                    this.cipher.push(piece);
                }, 0);
                this.cipher.sort((a, b) => a > b ? 1 : (a < b) ? -1 : 0);
                return this;
            }

            decrypt(dictionary) {
                return this.cipher.map((atom, idx) => dictionary[atom + this.keys[idx]]).join("");
            }

            getKeys() {
                this.keys = [5, 1, 1, -92, -490];
                return this;

            }
        }

        let dictionary = ["自", "由", "自", "在", "功", "不", "可", "没", "卓", "有", "成", "效", "大", "吉", "大", "利", "A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L", "M", "N", "O", "P", "Q", "R", "S", "T", "U", "V", "W", "X", "Y", "Z"];
        return new Pizza(666).getKeys().getCipher().decrypt(dictionary);
    }