汉字获取首字母多音字
//DEMO http://download.csdn.net/detail/qq873113580/6033615
using Microsoft.International.Converters.PinYinConverter;
using System;
using System.Collections.Generic;
using System.Collections.ObjectModel;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;
using System.Threading.Tasks;
namespace ConsoleApplication1
{
class Program
{
static void Main(string[] args)
{
List<string> ss = GetPYAll("其他");
//输出集合为 qi-ta ji-ta 然后再截取就好了
}
/// <summary>
/// 获取全拼
/// </summary>
/// <param name="str"></param>
/// <returns>返回一个多音集合（如：其原本多音字为 qi ji 输入“其他”返回qita jita）</returns>
public static List<string> GetPYAll(string str)
{
List<string> soruceList = new List<string>();
//用来组合的拼音集合
List<string> list = new List<string>();
//每个位置对应的拼音集合
Dictionary<int, List<string>> dic = new Dictionary<int, List<string>>();
char[] chars = str.ToCharArray();
for (int i = 0; i < chars.Length; i++)
{
List<string> tempList=new List<string>();
if (new Regex(@"^[\u4e00-\u9fa5]+$").Match(chars[i].ToString()).Success)
{
ChineseChar chineseChar = new ChineseChar(chars[i]);
ReadOnlyCollection<string> pyColl = chineseChar.Pinyins;
//循环生成首字母的笛卡尔积,存储到临时拼音列表
foreach (var item in pyColl)
{
if (item != null)
{
string temp = item.Remove(item.Length - 1, 1);
list.Add(temp);
if(!tempList.Contains(temp))
{
tempList.Add(temp);
}
}
}
}
else//不是汉字的
{
tempList.Add(chars[i].ToString());
list.Add(chars[i].ToString());
}
dic.Add(i, tempList);
}
//组合
List<string[]> lst_Combination = PermutationAndCombination<string>.GetCombination(list.ToArray(), str.Length);
//求取组合中以第一个字的拼音开头的
foreach (string[] strs in lst_Combination)
{
bool b = false;
for (int i = 0; i < strs.Length; i++)
{
if (dic[i].Contains(strs[i]))
{
b = true;
}
else
{
b = false;
break;
}
}
if (b)
{
soruceList.Add(string.Join("-", strs));
}
}
return soruceList;
}
}
}
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace ConsoleApplication1
{
public class PermutationAndCombination<T>
{
/// <summary>
/// 交换两个变量
/// </summary>
/// <param name="a">变量1</param>
/// <param name="b">变量2</param>
public static void Swap(ref T a, ref T b)
{
T temp = a;
a = b;
b = temp;
}
/// <summary>
/// 递归算法求数组的组合(私有成员)
/// </summary>
/// <param name="list">返回的范型</param>
/// <param name="t">所求数组</param>
/// <param name="n">辅助变量</param>
/// <param name="m">辅助变量</param>
/// <param name="b">辅助数组</param>
/// <param name="M">辅助变量M</param>
private static void GetCombination(ref List<T[]> list, T[] t, int n, int m, int[] b, int M)
{
for (int i = n; i >= m; i--)
{
b[m - 1] = i - 1;
if (m > 1)
{
GetCombination(ref list, t, i - 1, m - 1, b, M);
}
else
{
if (list == null)
{
list = new List<T[]>();
}
T[] temp = new T[M];
for (int j = 0; j < b.Length; j++)
{
temp[j] = t[b[j]];
}
list.Add(temp);
}
}
}
/// <summary>
/// 递归算法求排列(私有成员)
/// </summary>
/// <param name="list">返回的列表</param>
/// <param name="t">所求数组</param>
/// <param name="startIndex">起始标号</param>
/// <param name="endIndex">结束标号</param>
private static void GetPermutation(ref List<T[]> list, T[] t, int startIndex, int endIndex)
{
if (startIndex == endIndex)
{
if (list == null)
{
list = new List<T[]>();
}
T[] temp = new T[t.Length];
t.CopyTo(temp, 0);
list.Add(temp);
}
else
{
for (int i = startIndex; i <= endIndex; i++)
{
Swap(ref t[startIndex], ref t[i]);
GetPermutation(ref list, t, startIndex + 1, endIndex);
Swap(ref t[startIndex], ref t[i]);
}
}
}
/// <summary>
/// 求从起始标号到结束标号的排列，其余元素不变
/// </summary>
/// <param name="t">所求数组</param>
/// <param name="startIndex">起始标号</param>
/// <param name="endIndex">结束标号</param>
/// <returns>从起始标号到结束标号排列的范型</returns>
public static List<T[]> GetPermutation(T[] t, int startIndex, int endIndex)
{
if (startIndex < 0 || endIndex > t.Length - 1)
{
return null;
}
List<T[]> list = new List<T[]>();
GetPermutation(ref list, t, startIndex, endIndex);
return list;
}
/// <summary>
/// 返回数组所有元素的全排列
/// </summary>
/// <param name="t">所求数组</param>
/// <returns>全排列的范型</returns>
public static List<T[]> GetPermutation(T[] t)
{
return GetPermutation(t, 0, t.Length - 1);
}
/// <summary>
/// 求数组中n个元素的排列
/// </summary>
/// <param name="t">所求数组</param>
/// <param name="n">元素个数</param>
/// <returns>数组中n个元素的排列</returns>
public static List<T[]> GetPermutation(T[] t, int n)
{
if (n > t.Length)
{
return null;
}
List<T[]> list = new List<T[]>();
List<T[]> c = GetCombination(t, n);
for (int i = 0; i < c.Count; i++)
{
List<T[]> l = new List<T[]>();
GetPermutation(ref l, c[i], 0, n - 1);
list.AddRange(l);
}
return list;
}
/// <summary>
/// 求数组中n个元素的组合
/// </summary>
/// <param name="t">所求数组</param>
/// <param name="n">元素个数</param>
/// <returns>数组中n个元素的组合的范型</returns>
public static List<T[]> GetCombination(T[] t, int n)
{
if (t.Length < n)
{
return null;
}
int[] temp = new int[n];
List<T[]> list = new List<T[]>();
GetCombination(ref list, t, t.Length, n, temp, n);
return list;
}
}
}
