| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| #include <string> |
| #include <vector> |
| |
| std::string likes(const std::vector<std::string> &names) |
| { |
| using namespace std; |
| string ans = ""; |
| if(names.empty()){ |
| ans+="no one"; |
| }else{ |
| ans+=names[0]; |
| } |
| if(names.size()>=3){ |
| ans+=", "+names[1]; |
| } |
| if(names.size()>=2){ |
| ans+=" and"; |
| } |
| if(names.size()==2||names.size()==3){ |
| ans+=" "+names.back(); |
| }else if(names.size()>=4){ |
| ans+=" "+std::to_string(names.size()-2)+" others"; |
| } |
| if(names.size()<=1){ |
| ans+=" likes this"; |
| }else{ |
| ans+=" like this"; |
| } |
| return ans; |
| } |
BestPractice
| |
| |
| |
| |
| |
| |
| #include <string> |
| #include <vector> |
| std::string likes(const std::vector<std::string> &names){ |
| switch(names.size()){ |
| case 0: return "no one likes this"; |
| case 1: return names[0] + " likes this"; |
| case 2: return names[0] + " and " + names[1] + " like this"; |
| case 3: return names[0] + ", " + names[1] + " and " + names[2] + " like this"; |
| default: return names[0] + ", " + names[1] + " and " + std::to_string(names.size() - 2) + " others like this"; |
| } |
| } |
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 分享一个免费、快速、无限量使用的满血 DeepSeek R1 模型,支持深度思考和联网搜索!
· 基于 Docker 搭建 FRP 内网穿透开源项目(很简单哒)
· ollama系列01:轻松3步本地部署deepseek,普通电脑可用
· 25岁的心里话
· 按钮权限的设计及实现