This commit is contained in:
youngyangyang04
2020-07-07 09:56:51 +08:00
parent abd4aa6c0d
commit 9903e8f26d
3 changed files with 21 additions and 1 deletions

View File

@ -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) {

View File

@ -1,4 +1,3 @@
## 题目地址
https://leetcode-cn.com/problems/valid-anagram/

View 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]);
}
}
};
```