Base64位算法

最新推荐文章于 2021-11-26 18:02:41 发布

「已注销」

最新推荐文章于 2021-11-26 18:02:41 发布

阅读量171

点赞数

分类专栏： c++ 文章标签：字符串 leetcode python 数据结构算法

本文链接：https://blog.csdn.net/weixin_43875506/article/details/118925788

版权

c++ 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

base64位算法实现

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;

string base64_encode(string str){
	string base64_table="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
	int str_len = str.length();
	string res="";
	//注意这里str_len/3*3 
	//通过字符的ascii二进制位运算组合成base64编码二进制 
	for (int strp=0; strp<str_len/3*3; strp+=3){
		res+=base64_table[str[strp]>>2];
		res+=base64_table[(str[strp]&0x3)<<4 | (str[strp+1])>>4];
		res+=base64_table[(str[strp+1]&0xf)<<2 | (str[strp+2])>>6];
		res+=base64_table[(str[strp+2])&0x3f]; 
		//cout<<res<<endl; 
	}
	if (str_len%3==1){
		int pos=str_len/3 * 3;
		res += base64_table[str[pos]>>2];
		res += base64_table[(str[pos]&0x3)<<4];
		res += "=";	res += "=";
	}else if (str_len%3==2){
		int pos=str_len/3 * 3;
		res += base64_table[str[pos]>>2];
		res += base64_table[(str[pos]&0x3)<<4 | (str[pos+1])>>4];
		res += base64_table[(str[pos+1]&0xf)<<2];
		res += "=";
	}
	return res;
}

char a_to_c(int x){
//int转char 
	char ch=x;
	return ch;
}

int find_int(char ch){ 
//找base64表中字符对应的int值 
//string base64_table="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
	if (ch>='A' && ch<='Z')		return ch-'A'+0;
	else if (ch>='a' && ch<='z')	return ch-'a'+26;
	else if (ch>='0' && ch<='9')	return ch-'0'+52;
	else if (ch=='+')	return 62;
	else if (ch=='/')	return 63;
}
string base64_decode(string str){
	int str_len = str.length();
	string res="";
	int flag;
	if (str[str_len-1]=='=' && str[str_len-2]=='=')		flag=2;
	else if (str[str_len-1]=='=' && str[str_len-2]!='=')	flag = 1;
	else	flag = 0;
	//cout<<flag<<" "<<str;
	for (int strp=0; strp<str_len-4; strp+=4){
		res += a_to_c(find_int(str[strp])<<2 | find_int(str[strp+1])>>4);
		res += a_to_c(find_int(str[strp+1])<<4 | find_int(str[strp+2])>>2);
		res += a_to_c(find_int(str[strp+2])<<6 | find_int(str[strp+3]));
	}
	int pos = str_len-4;
	if (flag==1){	//原字符串模3余2 
		res += a_to_c(find_int(str[pos])<<2 | find_int(str[pos+1])>>4);
		res += a_to_c(find_int(str[pos+1])<<4 | find_int(str[pos+2])>>2); 
	}else if (flag==2){	//原字符串模3余1 
		res += a_to_c(find_int(str[pos])<<2 | find_int(str[pos+1])>>4);
	}else if (flag==0){
		res += a_to_c(find_int(str[pos])<<2 | find_int(str[pos+1])>>4);
		res += a_to_c(find_int(str[pos+1])<<4 | find_int(str[pos+2])>>2);
		res += a_to_c(find_int(str[pos+2])<<6 | find_int(str[pos+3]));
	}
	return res; 
} 
int main(){
	string str="hellowo sorlds";
	//cout<<base64_encode(str);
	cout<<base64_decode(base64_encode(str));
	return 0;
}