汇顶笔试题

题目:

Base64加密转换原理与代码实现

#include <iostream>
#include <vector>
#include <string>
using namespace std;

int main() {
	vector<char> mp{ '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',
	'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',
	'0','1','2','3','4','5','6','7','8','9','+','/' };
	string ans;
	string str;
	cin >> str;
	int index = str.size();
	char add = 0;
	int plus = 0;
	if (index % 3 == 1) {
		str.push_back(add);
		str.push_back(add);
		plus = 2;
	}
	if (index % 3 == 2) {
		str.push_back(add);
		plus = 1;
	}
	int start = 0;
	index= str.size();
	while (index >= 3) {
		int temp1= str[start];
		temp1 = temp1 << 16;
		int temp2 = str[start+1];
		temp2 = temp2 << 8;
		int temp3 = str[start+2];
		int res = temp1 | temp2 | temp3;

		int sub1 = (res >> 18) & 0x3f;
		int sub2 = (res >> 12) & 0x3f;
		int sub3 = (res >> 6) & 0x3f;
		int sub4 = res & 0x3f;

		ans.push_back(mp[sub1]);
		ans.push_back(mp[sub2]);
		ans.push_back(mp[sub3]);
		ans.push_back(mp[sub4]);

		index -= 3;
        start += 3;
	}
	if (plus == 1) {
		ans.pop_back();
		ans.push_back('=');
	}
	if (plus == 2) {
		ans.pop_back();
		ans.pop_back();
		ans.push_back('=');
		ans.push_back('=');
	}

	cout << ans;

	return 0;
}

 

  • 1
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值