c++ 中文转拼音的封装, char 类型 不支持 中文 已解决

2024-04-13 12:44

本文主要是介绍c++ 中文转拼音的封装, char 类型 不支持 中文 已解决,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!

        在日常业务中,需要进行中文转拼音的检索。已便实现对应的 模糊搜索。

 使用方法

	std::string res = "我是中国人";char* result = new char[res.length() + 1];for (int i = 0; i < res.length(); ++i){result[i] = res[i];}result[res.length()] = '\0';std::string str2(result);std::string p = m_pinyin->chineseConvertPinYinAllSpell(str2);qDebug() << "pinyin 9999999999999" << p;
void CCendPinyinSearch::insertSearchIndex(int index,QString name)
{// 检索索引QMap<int,QString> m_pSearchIndex;m_pSearchIndex.insert(index, name);
}void CCendPinyinSearch::getSeachIndexList(QString name)
{QMap<int, QString>::const_iterator i;for (i = m_pSearchIndex.constBegin(); i != m_pSearchIndex.constEnd(); ++i) {qDebug() << "123123777777777777777 index" << i.key() << ": " << i.value();if (i.value() == name){qDebug() << "123123123888888888888 index" << i.key() << ": " << i.value();}}
}//检查哈希表  查找
bool CCendPinyinSearch::isContainsAllCharactersHash(const std::string& mainString, const std::string& subString) {// 初始化哈希表  std::unordered_map<char, int> charCounts;for (char c : subString) {charCounts[c]++;}// 遍历主字符串并更新哈希表  for (char c : mainString) {if (charCounts.find(c) != charCounts.end()) {charCounts[c]--;if (charCounts[c] == 0) {// 如果字符的计数减到0,从哈希表中删除该字符  charCounts.erase(c);}}}// 检查哈希表  return charCounts.empty(); // 如果哈希表为空,说明所有字符都被找到了  
}// 排序算法 查找匹配
bool CCendPinyinSearch::isContainsAllCharacters(const std::string& mainString, const std::string& subString) {// 对两个字符串进行排序std::string sorted_main = mainString;std::string sorted_sub = subString;std::sort(sorted_main.begin(), sorted_main.end());std::sort(sorted_sub.begin(), sorted_sub.end());// 使用双指针法检查 sorted_sub 是否是 sorted_main 的子序列  int i = 0, j = 0;while (i < sorted_sub.length() && j < sorted_main.length()) {if (sorted_sub[i] == sorted_main[j]) {i++; // 移动到 sorted_sub 的下一个字符  }j++; // 移动到 sorted_main 的下一个字符  }// 如果 sorted_sub 的所有字符都在 sorted_main 中找到,则 sorted_sub 是 sorted_main 的子序列  return  sorted_sub.length() == i;
}std::string CCendPinyinSearch::chineseConvertPinYinAllSpell(const std::string & dest_chinese)
{static const int spell_value[] = { -20319, -20317, -20304, -20295,-20292, -20283, -20265, -20257, -20242, -20230, -20051, -20036,-20032, -20026,-20002, -19990, -19986, -19982, -19976, -19805, -19784, -19775,-19774, -19763, -19756, -19751, -19746, -19741, -19739, -19728,-19725, -19715, -19540, -19531, -19525, -19515, -19500, -19484,-19479, -19467, -19289, -19288, -19281, -19275, -19270, -19263,-19261, -19249, -19243, -19242, -19238, -19235, -19227, -19224,-19218, -19212, -19038, -19023, -19018, -19006, -19003, -18996,-18977, -18961, -18952, -18783, -18774, -18773, -18763, -18756,-18741, -18735, -18731, -18722, -18710, -18697, -18696, -18526,-18518, -18501, -18490, -18478, -18463, -18448, -18447, -18446,-18239, -18237, -18231, -18220, -18211, -18201, -18184, -18183,-18181, -18012, -17997, -17988, -17970, -17964, -17961, -17950,-17947, -17931, -17928, -17922, -17759, -17752, -17733, -17730,-17721, -17703, -17701, -17697, -17692, -17683, -17676, -17496,-17487, -17482, -17468, -17454, -17433, -17427, -17417, -17202,-17185, -16983, -16970, -16942, -16915, -16733, -16708, -16706,-16689, -16664, -16657, -16647, -16474, -16470, -16465, -16459,-16452, -16448, -16433, -16429, -16427, -16423, -16419, -16412,-16407, -16403, -16401, -16393, -16220, -16216, -16212, -16205,-16202, -16187, -16180, -16171, -16169, -16158, -16155, -15959,-15958, -15944, -15933, -15920, -15915, -15903, -15889, -15878,-15707, -15701, -15681, -15667, -15661, -15659, -15652, -15640,-15631, -15625, -15454, -15448, -15436, -15435, -15419, -15416,-15408, -15394, -15385, -15377, -15375, -15369, -15363, -15362,-15183, -15180, -15165, -15158, -15153, -15150, -15149, -15144,-15143, -15141, -15140, -15139, -15128, -15121, -15119, -15117,-15110, -15109, -14941, -14937, -14933, -14930, -14929, -14928,-14926, -14922, -14921, -14914, -14908, -14902, -14894, -14889,-14882, -14873, -14871, -14857, -14678, -14674, -14670, -14668,-14663, -14654, -14645, -14630, -14594, -14429, -14407, -14399,-14384, -14379, -14368, -14355, -14353, -14345, -14170, -14159,-14151, -14149, -14145, -14140, -14137, -14135, -14125, -14123,-14122, -14112, -14109, -14099, -14097, -14094, -14092, -14090,-14087, -14083, -13917, -13914, -13910, -13907, -13906, -13905,-13896, -13894, -13878, -13870, -13859, -13847, -13831, -13658,-13611, -13601, -13406, -13404, -13400, -13398, -13395, -13391,-13387, -13383, -13367, -13359, -13356, -13343, -13340, -13329,-13326, -13318, -13147, -13138, -13120, -13107, -13096, -13095,-13091, -13076, -13068, -13063, -13060, -12888, -12875, -12871,-12860, -12858, -12852, -12849, -12838, -12831, -12829, -12812,-12802, -12607, -12597, -12594, -12585, -12556, -12359, -12346,-12320, -12300, -12120, -12099, -12089, -12074, -12067, -12058,-12039, -11867, -11861, -11847, -11831, -11798, -11781, -11604,-11589, -11536, -11358, -11340, -11339, -11324, -11303, -11097,-11077, -11067, -11055, -11052, -11045, -11041, -11038, -11024,-11020, -11019, -11018, -11014, -10838, -10832, -10815, -10800,-10790, -10780, -10764, -10587, -10544, -10533, -10519, -10331,-10329, -10328, -10322, -10315, -10309, -10307, -10296, -10281,-10274, -10270, -10262, -10260, -10256, -10254 };// 395个字符串,每个字符串长度不超过6 static const char spell_dict[396][7] = { "a", "ai", "an", "ang","ao", "ba", "bai", "ban", "bang", "bao", "bei", "ben", "beng", "bi","bian", "biao","bie", "bin", "bing", "bo", "bu", "ca", "cai", "can", "cang", "cao","ce", "ceng", "cha", "chai", "chan", "chang", "chao", "che", "chen","cheng", "chi", "chong", "chou", "chu", "chuai", "chuan", "chuang","chui", "chun", "chuo", "ci", "cong", "cou", "cu", "cuan", "cui","cun", "cuo", "da", "dai", "dan", "dang", "dao", "de", "deng", "di","dian", "diao", "die", "ding", "diu", "dong", "dou", "du", "duan","dui", "dun", "duo", "e", "en", "er", "fa", "fan", "fang", "fei","fen", "feng", "fo", "fou", "fu", "ga", "gai", "gan", "gang", "gao","ge", "gei", "gen", "geng", "gong", "gou", "gu", "gua", "guai","guan", "guang", "gui", "gun", "guo", "ha", "hai", "han", "hang","hao", "he", "hei", "hen", "heng", "hong", "hou", "hu", "hua","huai", "huan", "huang", "hui", "hun", "huo", "ji", "jia", "jian","jiang", "jiao", "jie", "jin", "jing", "jiong", "jiu", "ju", "juan","jue", "jun", "ka", "kai", "kan", "kang", "kao", "ke", "ken","keng", "kong", "kou", "ku", "kua", "kuai", "kuan", "kuang", "kui","kun", "kuo", "la", "lai", "lan", "lang", "lao", "le", "lei","leng", "li", "lia", "lian", "liang", "liao", "lie", "lin", "ling","liu", "long", "lou", "lu", "lv", "luan", "lue", "lun", "luo","ma", "mai", "man", "mang", "mao", "me", "mei", "men", "meng", "mi","mian", "miao", "mie", "min", "ming", "miu", "mo", "mou", "mu","na", "nai", "nan", "nang", "nao", "ne", "nei", "nen", "neng", "ni","nian", "niang", "niao", "nie", "nin", "ning", "niu", "nong","nu", "nv", "nuan", "nue", "nuo", "o", "ou", "pa", "pai", "pan","pang", "pao", "pei", "pen", "peng", "pi", "pian", "piao", "pie","pin", "ping", "po", "pu", "qi", "qia", "qian", "qiang", "qiao","qie", "qin", "qing", "qiong", "qiu", "qu", "quan", "que", "qun","ran", "rang", "rao", "re", "ren", "reng", "ri", "rong", "rou","ru", "ruan", "rui", "run", "ruo", "sa", "sai", "san", "sang","sao", "se", "sen", "seng", "sha", "shai", "shan", "shang", "shao","she", "shen", "sheng", "shi", "shou", "shu", "shua","shuai", "shuan", "shuang", "shui", "shun", "shuo", "si", "song","sou", "su", "suan", "sui", "sun", "suo", "ta", "tai","tan", "tang", "tao", "te", "teng", "ti", "tian", "tiao", "tie","ting", "tong", "tou", "tu", "tuan", "tui", "tun", "tuo","wa", "wai", "wan", "wang", "wei", "wen", "weng", "wo", "wu", "xi","xia", "xian", "xiang", "xiao", "xie", "xin", "xing","xiong", "xiu", "xu", "xuan", "xue", "xun", "ya", "yan", "yang","yao", "ye", "yi", "yin", "ying", "yo", "yong", "you","yu", "yuan", "yue", "yun", "za", "zai", "zan", "zang", "zao", "ze","zei", "zen", "zeng", "zha", "zhai", "zhan", "zhang","zhao", "zhe", "zhen", "zheng", "zhi", "zhong", "zhou", "zhu","zhua", "zhuai", "zhuan", "zhuang", "zhui", "zhun", "zhuo","zi", "zong", "zou", "zu", "zuan", "zui", "zun", "zuo" };std::string pinyin;const int length = dest_chinese.length();for (int j = 0, chrasc = 0; j < length;) {// 非汉字处理if (dest_chinese.at(j) >= 0 && dest_chinese.at(j) < 128) {pinyin += dest_chinese[j];// 偏移下标j++;continue;} // 汉字处理chrasc = dest_chinese[j] * 256 + dest_chinese[j + 1] + 256;if (chrasc > 0 && chrasc < 160) {// 非汉字pinyin += dest_chinese.at(j);// 偏移下标j++;}else {// 汉字for (int i = (sizeof(spell_value) / sizeof(spell_value[0]) - 1);i >= 0; --i) {// 查找字典if (spell_value[i] <= chrasc) {pinyin += spell_dict[i];break;}} // 偏移下标 (汉字双字节)j += 2;}}// for endreturn pinyin;
}

 测试的 拼音完全正确,谁能告诉我哪儿出错l

错误的拼音!!! 

 拼音 翻译的很到位,关键不认识!

正确的 拼音

		// 查询 数据拼音//std::string p = m_pPinyinSearch->chineseConvertPinYinAllSpell(searchName.toStdString());std::string p = m_pPinyinSearch->chineseConvertPinYinAllSpell(string((const char*)searchName.toLocal8Bit()));

 

string与QString之间的转换 

 1.fromStdString直接转换

string str;
QString qstr;//从QString 到 std::string
str = qstr.toStdString();//从std::string 到QString
qstr = QString::fromStdString(str);

 2.fromLocal8Bit(cstr.c_str())

std::string cstr;
QString qstring;//从std::string 到QString
qstring = QString(QString::fromLocal8Bit(cstr.c_str()));//从QString 到 std::string
cstr = string((const char *)qstring.toLocal8Bit());

参考 

C++ 解决string转为char*中文乱码问题_char* 中文乱码-CSDN博客

突破编程_C++_字符串算法(判断字符串是否包含)_c++判断字符串是否含有某字符串-CSDN博客

这篇关于c++ 中文转拼音的封装, char 类型 不支持 中文 已解决的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!



http://www.chinasem.cn/article/900177

相关文章

关于C++中的虚拟继承的一些总结(虚拟继承,覆盖,派生,隐藏)

1.为什么要引入虚拟继承 虚拟继承是多重继承中特有的概念。虚拟基类是为解决多重继承而出现的。如:类D继承自类B1、B2,而类B1、B2都继承自类A,因此在类D中两次出现类A中的变量和函数。为了节省内存空间,可以将B1、B2对A的继承定义为虚拟继承,而A就成了虚拟基类。实现的代码如下: class A class B1:public virtual A; class B2:pu

C++对象布局及多态实现探索之内存布局(整理的很多链接)

本文通过观察对象的内存布局,跟踪函数调用的汇编代码。分析了C++对象内存的布局情况,虚函数的执行方式,以及虚继承,等等 文章链接:http://dev.yesky.com/254/2191254.shtml      论C/C++函数间动态内存的传递 (2005-07-30)   当你涉及到C/C++的核心编程的时候,你会无止境地与内存管理打交道。 文章链接:http://dev.yesky

C++的模板(八):子系统

平常所见的大部分模板代码,模板所传的参数类型,到了模板里面,或实例化为对象,或嵌入模板内部结构中,或在模板内又派生了子类。不管怎样,最终他们在模板内,直接或间接,都实例化成对象了。 但这不是唯一的用法。试想一下。如果在模板内限制调用参数类型的构造函数会发生什么?参数类的对象在模板内无法构造。他们只能从模板的成员函数传入。模板不保存这些对象或者只保存他们的指针。因为构造函数被分离,这些指针在模板外

C++工程编译链接错误汇总VisualStudio

目录 一些小的知识点 make工具 可以使用windows下的事件查看器崩溃的地方 dumpbin工具查看dll是32位还是64位的 _MSC_VER .cc 和.cpp 【VC++目录中的包含目录】 vs 【C/C++常规中的附加包含目录】——头文件所在目录如何怎么添加,添加了以后搜索头文件就会到这些个路径下搜索了 include<> 和 include"" WinMain 和

C/C++的编译和链接过程

目录 从源文件生成可执行文件(书中第2章) 1.Preprocessing预处理——预处理器cpp 2.Compilation编译——编译器cll ps:vs中优化选项设置 3.Assembly汇编——汇编器as ps:vs中汇编输出文件设置 4.Linking链接——链接器ld 符号 模块,库 链接过程——链接器 链接过程 1.简单链接的例子 2.链接过程 3.地址和

2024.6.24 IDEA中文乱码问题(服务器 控制台 TOMcat)实测已解决

1.问题产生原因: 1.文件编码不一致:如果文件的编码方式与IDEA设置的编码方式不一致,就会产生乱码。确保文件和IDEA使用相同的编码,通常是UTF-8。2.IDEA设置问题:检查IDEA的全局编码设置和项目编码设置是否正确。3.终端或控制台编码问题:如果你在终端或控制台看到乱码,可能是终端的编码设置问题。确保终端使用的是支持你的文件的编码方式。 2.解决方案: 1.File -> S

C++必修:模版的入门到实践

✨✨ 欢迎大家来到贝蒂大讲堂✨✨ 🎈🎈养成好习惯,先赞后看哦~🎈🎈 所属专栏:C++学习 贝蒂的主页:Betty’s blog 1. 泛型编程 首先让我们来思考一个问题,如何实现一个交换函数? void swap(int& x, int& y){int tmp = x;x = y;y = tmp;} 相信大家很快就能写出上面这段代码,但是如果要求这个交换函数支持字符型

公共筛选组件(二次封装antd)支持代码提示

如果项目是基于antd组件库为基础搭建,可使用此公共筛选组件 使用到的库 npm i antdnpm i lodash-esnpm i @types/lodash-es -D /components/CommonSearch index.tsx import React from 'react';import { Button, Card, Form } from 'antd'

(超详细)YOLOV7改进-Soft-NMS(支持多种IoU变种选择)

1.在until/general.py文件最后加上下面代码 2.在general.py里面找到这代码,修改这两个地方 3.之后直接运行即可

C++入门01

1、.h和.cpp 源文件 (.cpp)源文件是C++程序的实际实现代码文件,其中包含了具体的函数和类的定义、实现以及其他相关的代码。主要特点如下:实现代码: 源文件中包含了函数、类的具体实现代码,用于实现程序的功能。编译单元: 源文件通常是一个编译单元,即单独编译的基本单位。每个源文件都会经过编译器的处理,生成对应的目标文件。包含头文件: 源文件可以通过#include指令引入头文件,以使