1180. Count Substrings with Only One Distinct Letter ==================================================== :题号: 1180 :题名: Count Substrings with Only One Distinct Letter :类型: Premium(元数据占位) :难度: Easy :原题: `LeetCode 1180 `_ :数据源: LeetCode GraphQL :处理状态: 题目文件已建立;题目信息、题目重述与自建示例待下一轮补充。