题解 | 寻找Coder

class Coder {
public:
    vector<string> findCoder(vector<string>& A, int n) {
        vector<pair<string, pair<int, int>>> data;  // 字符串，<次数，原始位置>
        
        // 统计每个字符串中"Coder"出现的次数
        for(int i = 0; i < n; i++) {
            int count = countCoder(A[i]);
            if(count > 0) {
                data.push_back({A[i], {count, i}});
            }
        }
        
        // 稳定排序
        stable_sort(data.begin(), data.end(), 
            [](const auto& a, const auto& b) {
                return a.second.first > b.second.first;
            });
        
        // 提取结果
        vector<string> result;
        for(const auto& item : data) {
            result.push_back(item.first);
        }
        
        return result;
    }
    
private:
    int countCoder(const string& s) {
        string str = s;
        // 转换为小写
        transform(str.begin(), str.end(), str.begin(), ::tolower);
        
        int count = 0;
        size_t pos = 0;
        while((pos = str.find("coder", pos)) != string::npos) {
            count++;
            pos++;
        }
        return count;
    }
};

import java.util.*;

public class Coder {
    public String[] findCoder(String[] A, int n) {
        // 创建数组存储字符串和出现次数
        class StringCount implements Comparable<StringCount> {
            String str;
            int count;
            int index;
            
            StringCount(String s, int c, int i) {
                str = s;
                count = c;
                index = i;
            }
            
            @Override
            public int compareTo(StringCount other) {
                if(this.count != other.count) {
                    return other.count - this.count;  // 降序
                }
                return this.index - other.index;  // 保持原顺序
            }
        }
        
        List<StringCount> list = new ArrayList<>();
        
        // 统计每个字符串中"Coder"出现的次数
        for(int i = 0; i < n; i++) {
            int count = countCoder(A[i]);
            if(count > 0) {
                list.add(new StringCount(A[i], count, i));
            }
        }
        
        // 排序
        Collections.sort(list);
        
        // 提取结果
        String[] result = new String[list.size()];
        for(int i = 0; i < list.size(); i++) {
            result[i] = list.get(i).str;
        }
        
        return result;
    }
    
    private int countCoder(String s) {
        String str = s.toLowerCase();
        int count = 0;
        int index = 0;
        
        while((index = str.indexOf("coder", index)) != -1) {
            count++;
            index++;
        }
        
        return count;
    }
}

class Coder:
    def findCoder(self, A, n):
        # Count "Coder" occurrences and store with original index
        counts = []
        for i, s in enumerate(A):
            count = self.countCoder(s)
            if count > 0:
                counts.append((s, count, i))
        
        # Sort by count (descending) and original index
        counts.sort(key=lambda x: (-x[1], x[2]))
        
        # Extract result
        return [x[0] for x in counts]
    
    def countCoder(self, s):
        s = s.lower()
        count = 0
        i = 0
        while i < len(s):
            i = s.find('coder', i)
            if i == -1:
                break
            count += 1
            i += 1
        return count