简单的ROT13码编码与解码

ROT13码意思是将字母左移13位。如'A' ↔ 'N', 'B' ↔ 'O','V' ↔ 'I'。

下面实现ROT13码的解码。

function rot13(str) {
  var arr = [];
  for (var i = 0; i < str.length; i++) {
    if (str.charCodeAt(i) >= 65 && str.charCodeAt(i) <= 77) {
      arr.push(str.charCodeAt(i) - 64 + 90 - 13);
    } else if (str.charCodeAt(i) > 77 && str.charCodeAt(i) <= 90) {
      arr.push(str.charCodeAt(i) - 13);
    } else {
      arr.push(str.charCodeAt(i));
    }
  }
  var newStr = "";
  for (var j = 0; j < arr.length; j++) {
    newStr += String.fromCharCode(arr[j]);
  }
  return newStr;
}

rot13("SERR PBQR PNZC");  //这是编码之后的字符串。

结果是:"FREE CODE CAMP"

 

注意这里只考虑了大写字母。其中用到的函数:String.prototype.charCodeAt()String.fromCharCode()

转载于:https://www.cnblogs.com/RRirring/p/5718749.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
哈夫曼树是一种常用的数据结构,可以用于数据的压缩和解压缩。下面是C++实现的哈夫曼树编码解码的示例代: ```c++ #include <iostream> #include <string> #include <queue> #include <unordered_map> using namespace std; struct TreeNode { char ch; int freq; TreeNode* left; TreeNode* right; TreeNode(char c, int f) : ch(c), freq(f), left(nullptr), right(nullptr) {} }; struct Compare { bool operator() (const TreeNode* a, const TreeNode* b) { return a->freq > b->freq; } }; void buildHuffmanTree(string str, unordered_map<char, int>& freqMap, priority_queue<TreeNode*, vector<TreeNode*>, Compare>& minHeap) { for (char c : str) { if (freqMap.find(c) == freqMap.end()) { freqMap[c] = 1; } else { freqMap[c]++; } } for (auto& entry : freqMap) { TreeNode* node = new TreeNode(entry.first, entry.second); minHeap.push(node); } while (minHeap.size() > 1) { TreeNode* left = minHeap.top(); minHeap.pop(); TreeNode* right = minHeap.top(); minHeap.pop(); TreeNode* parent = new TreeNode('$', left->freq + right->freq); parent->left = left; parent->right = right; minHeap.push(parent); } } void encode(TreeNode* node, string code, unordered_map<char, string>& codeMap) { if (node == nullptr) return; if (node->left == nullptr && node->right == nullptr) { codeMap[node->ch] = code; return; } encode(node->left, code + "0", codeMap); encode(node->right, code + "1", codeMap); } void huffmanEncode(string str, unordered_map<char, string>& codeMap) { unordered_map<char, int> freqMap; priority_queue<TreeNode*, vector<TreeNode*>, Compare> minHeap; buildHuffmanTree(str, freqMap, minHeap); TreeNode* root = minHeap.top(); encode(root, "", codeMap); } void huffmanDecode(TreeNode* root, string code, string& result) { if (root == nullptr) return; TreeNode* curr = root; for (char c : code) { if (c == '0') { curr = curr->left; } else { curr = curr->right; } if (curr->left == nullptr && curr->right == nullptr) { result += curr->ch; curr = root; } } } int main() { string str = "hello world"; unordered_map<char, string> codeMap; huffmanEncode(str, codeMap); string encoded = ""; for (char c : str) { encoded += codeMap[c]; } cout << "Encoded string: " << encoded << endl; string decoded = ""; TreeNode* root = new TreeNode('$', 0); for (auto& entry : codeMap) { string code = entry.second; char ch = entry.first; TreeNode* curr = root; for (char c : code) { if (c == '0') { if (curr->left == nullptr) { curr->left = new TreeNode('$', 0); } curr = curr->left; } else { if (curr->right == nullptr) { curr->right = new TreeNode('$', 0); } curr = curr->right; } } curr->ch = ch; } huffmanDecode(root, encoded, decoded); cout << "Decoded string: " << decoded << endl; return 0; } ``` 以上代实现了哈夫曼树的编码解码,其中`buildHuffmanTree`函数用于构建哈夫曼树,`encode`函数用于将哈夫曼树转换为编码表,`huffmanEncode`函数用于对字符串进行编码,`huffmanDecode`函数用于对编码后的字符串进行解码
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值