LeetCode暑期刷题打卡——字符串专题day5

最新推荐文章于 2024-07-18 08:26:33 发布

chstor

最新推荐文章于 2024-07-18 08:26:33 发布

阅读量152

点赞数

分类专栏： leetcode题目文章标签： leetcode 算法 c++

本文链接：https://blog.csdn.net/weixin_45821690/article/details/130395260

版权

leetcode题目专栏收录该内容

13 篇文章 0 订阅

订阅专栏

208. 实现 Trie (前缀树)

在这里插入图片描述

struct Node{
        bool is_end;
        Node *son[26];
        Node(){
            is_end = false;
            for(int i = 0; i < 26; i ++) son[i] = NULL;
        }
    }*root;
    Trie() {
        root = new Node();
    }
    
    void insert(string word) {
        auto p = root;
        for(auto c : word){
            int u = c - 'a';
            if(p->son[u] == NULL) p->son[u] = new Node();
            p = p->son[u];
        }
        p->is_end = true;
    }
    
    bool search(string word) {
        auto p = root;
        for(auto c : word){
            int u = c - 'a';
            if(p->son[u] == NULL) return false;
            p = p->son[u];
        }
        return p->is_end;
    }
    
    bool startsWith(string prefix) {
        auto p = root;
        for(auto c : prefix){
            int u = c - 'a';
            if(p->son[u] == NULL) return false;
            p = p->son[u];
        }
        return true;
    }

273. 整数转换英文表示

在这里插入图片描述

string small[20] = {"Zero","One","Two","Three","Four","Five","Six","Seven","Eight","Nine","Ten",
                        "Eleven","Twelve","Thirteen","Fourteen","Fifteen","Sixteen","Seventeen","Eighteen","Nineteen"};
    string decade[10] = {"","","Twenty","Thirty","Forty","Fifty","Sixty","Seventy","Eighty","Ninety"};
    string big[4] = {"Billion","Million","Thousand",""};

    string numberToWords(int num) {
        if(!num) return small[0];
        
        string res;
        for(int i = 1e9,j = 0; i > 0; i /= 1000,j ++){
            if(num >= i){
                res += get_part(num/i) + big[j] + ' ';
                num %= i;
            }
        }
        while(res.back() == ' ') res.pop_back();
        return res;
    }

    string get_part(int num){
        string res;
        if(num >= 100){
            res += small[num/100] + " Hundred ";
            num %= 100;
        }
        if(!num) return res;
        if(num >= 20){
            res += decade[num/10] + ' ';
            num %= 10;
        }
        if(!num) return res;
        res += small[num] + ' ';
        return res;
    }