C#算法从入门到跑路 第1章：栈的应用

括号匹配

/// <summary>
/// 判断括号匹配
/// </summary>
/// <param name="str">字符串</param>
/// <returns>返回是否匹配</returns>
public static bool BracketsJudge(string str)
{
    IStack<char> sk = new LinkStack<char>();
    for(int i=0;i<str.Length;++i)
    {
        char ch = str[i];
        if (ch == '(' || ch == '[' || ch == '{')
            sk.Push(ch);
        else if (ch == ')')
        {
            if (sk.Pop() != '(')
                return false;
        }
        else if (ch == ']')
        {
            if (sk.Pop() != '[')
                return false;
        }
        else if (ch == '}')
        {
            if (sk.Top != '{')
                return false;
            sk.Pop();
        }
    }
    return sk.IsEmpty();
}

进制转换

/// <summary>
/// 进制转换
/// </summary>
/// <param name="num">原始数字</param>
/// <param name="p" >进制数</param>
/// <returns>返回字符串</returns>
public static string From10(int num,int p)
{
    if (num == 0)
        return "0";
    IStack<int> sk = new LinkStack<int>();
    StringBuilder sb = new StringBuilder();
    while(num!=0)
    {
        sk.Push(num % p);
        num /= p;
    }
    while(!sk.IsEmpty())
    {
        var u=sk.Pop();
        if (u > 10)
            sb.Append((char)('A' + u - 10));
        else
            sb.Append((char)(u+48));
    }
    return sb.ToString();
}