Javascript 检索绰号及其串中的花数，JS

function countFlowers(text) {
    const nickTag = "<>";
    const flower = ":flower:";
    const result = {};
    let currentNicks = null; // This will be a linked list (as no arrays allowed)

    let nickTagIndex = 0;
    let flowerIndex = 0;
    let flowerCount = 0;
    for (let token of text + nickTag) { // Add empty nick so to flush the remaining flowers
        if (token === nickTag[nickTagIndex]) {
            if (!nickTagIndex) {
                if (flowerCount) { // Flush flowers
                    // Assign the flowers to the nicks in the linked list
                    while (currentNicks) {
                        result[currentNicks.nick] = (result[currentNicks.nick] ?? 0) + flowerCount;
                        currentNicks = currentNicks.next;
                    }
                    flowerCount = 0;
                }
                currentNicks = { nick: "", next: currentNicks };
            }
            nickTagIndex = (nickTagIndex + 1) % nickTag.length;
        } else if (nickTagIndex) {
            currentNicks.nick += token.toLowerCase();
        } else if (currentNicks && token === flower[flowerIndex]) {
            flowerIndex = (flowerIndex + 1) % flower.length;
            if (!flowerIndex) {
                flowerCount++;
            }
        } else {
            flowerIndex = 0;
        }
    }

    return result;
}


const text = '<Jane>:flower: <Kate><john> :like: received:flower::flower:'
const result = countFlowers(text);
console.log(result);

function countFlowers(text) {
    const nickTag = "><"; // reversed!
    const flower = ":rewolf:";  // reversed!
    const result = {};
    let currentNick = "";

    let nickTagIndex = 0;
    let flowerIndex = 0;
    let flowerCount = 0;
    let addFlowerCount = 0;
    for (let i = text.length - 1; i >= 0; i--) { // Traverse in reverse
        let token = text[i];
        if (token === nickTag[nickTagIndex]) {
            if (flowerCount) {
                addFlowerCount = flowerCount;
                flowerCount = 0;
            }
            nickTagIndex = (nickTagIndex + 1) % nickTag.length;
            if (!nickTagIndex) {
                result[currentNick] = (result[currentNick] ?? 0) + addFlowerCount;
                currentNick = "";
            }
        } else if (nickTagIndex) {
            currentNick = token.toLowerCase() + currentNick; // prepend!
        } else if (token === flower[flowerIndex]) {
            flowerIndex = (flowerIndex + 1) % flower.length;
            if (!flowerIndex) {
                flowerCount++;
            }
        } else {
            flowerIndex = 0;
        }
    }

    return result;
}

// Your test cases:
const texts = [
    '<Jane>:flower: <kate>:like:<John> :like: received:flower::flower:',
    '<Jane>:flower: <kate>:flower: :flower: :flower: <John> :like: received:flower::flower:',
    '<Jane>:flower: <kate>:flower flower: flower:<John> :like: received:flower::flower:',
    '<Jane>:flower: <kate>:like:<John> :like: received:flower::flower: <Jane> alsdaksdjhsa <Jane> :flower: :flower:',
    '<Jane>:flower: <kate><Kim><Jacob><Emily> :like: received:flower::flower:  <Kim><Jacob><Jane>',
    ':flower: :flower: <Jane>:flower: <kate><John> :like: received:flower::flower: ',
];
for (const text of texts) {
    const result = countFlowers(text);
    console.log(result);
}