摘要: 第 321 场周赛 #1.找出中枢整数 找出中枢整数 Solution class Solution { public: int pivotInteger(int n) { int sum = (1 + n)* n / 2; int tmp = (int)sqrt(sum); return tmp * tmp == s 阅读全文
posted @ 2023-01-06 23:52 TTS-S 阅读(16) 评论(0) 推荐(0) 编辑
摘要: LeetCode第 322 场周赛 #1.回环句 回环句 Solution class Solution { public: bool isCircularSentence(string sentence) { int n = sentence.size(), i = 0; if (sentence[0] != sentence[n 阅读全文
posted @ 2023-01-06 00:00 TTS-S 阅读(16) 评论(0) 推荐(0) 编辑