mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-06 15:09:40 +08:00
Update
This commit is contained in:
@ -61,6 +61,8 @@ public:
|
||||
vector<vector<int>> threeSum(vector<int>& nums) {
|
||||
vector<vector<int>> result;
|
||||
sort(nums.begin(), nums.end());
|
||||
// 找出a + b + c = 0
|
||||
// a = nums[i], b = nums[left], c = nums[right]
|
||||
for (int i = 0; i < nums.size(); i++) {
|
||||
// 排序之后如果第一个元素已经大于零,那么无论如何组合都不可能凑成三元组,直接返回结果就可以了
|
||||
if (nums[i] > 0) {
|
||||
|
@ -1,4 +1,3 @@
|
||||
|
||||
## 题目地址
|
||||
|
||||
https://leetcode-cn.com/problems/valid-anagram/
|
||||
|
19
problems/0344.反转字符串.md
Normal file
19
problems/0344.反转字符串.md
Normal file
@ -0,0 +1,19 @@
|
||||
## 题目地址
|
||||
https://leetcode-cn.com/problems/reverse-string/
|
||||
|
||||
## 思路
|
||||
|
||||
遍历数组的前一半,同时和后一半做交换就可以了
|
||||
|
||||
## 代码
|
||||
|
||||
```
|
||||
class Solution {
|
||||
public:
|
||||
void reverseString(vector<char>& s) {
|
||||
for (int i = 0, j = s.size() - 1; i < s.size()/2; i++, j--) {
|
||||
swap(s[i],s[j]);
|
||||
}
|
||||
}
|
||||
};
|
||||
```
|
Reference in New Issue
Block a user