摘要：
https://www.hackerrank.com/challenges/time-conversion/problem?isFullScreen=true `string timeConversion(string s) { char c=s[s.size()-2]; if(c'P') { st 阅读全文
posted @ 2025-06-29 12:10
哒哒DaDa^_^
阅读(29)
评论(0)
推荐(0)
摘要：
`class Box{ public: Box(){ l=b=h=0; } Box(int l,int b,int h) { this->l=l; this->b=b; this->h=h; } Box(Box&box) { this->l=box.l; this->b=box.b; this->h 阅读全文
posted @ 2025-06-29 11:24
哒哒DaDa^_^
阅读(18)
评论(0)
推荐(0)
摘要：
2个for： `int birthdayCakeCandles(vector candles) { int max=INT_MIN; int count=0; for(auto i:candles) { if(i>max)max=i; } for(auto i:candles) { if(i==ma 阅读全文
posted @ 2025-06-29 10:56
哒哒DaDa^_^
阅读(3)
评论(0)
推荐(0)
摘要：
https://www.hackerrank.com/challenges/mini-max-sum/problem?isFullScreen=true O(N^2)解法 `void miniMaxSum(vector arr) { long long min=LLONG_MAX,max=LLONG 阅读全文
posted @ 2025-06-29 10:35
哒哒DaDa^_^
阅读(10)
评论(0)
推荐(0)
浙公网安备 33010602011771号