-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathvector_test.cpp
More file actions
83 lines (76 loc) · 1.94 KB
/
vector_test.cpp
File metadata and controls
83 lines (76 loc) · 1.94 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
//
// Created by yazhi on 7/27/22.
//
#include <iostream>
#include <vector>
#include "vector_test.h"
using namespace std;
void print_vector(vector<int> & v) {
for (int i : v)
cout << i << " ";
cout << "" << endl;
}
vector<vector<int>> threeSum(vector<int>& nums) {
vector<vector<int>> res;
//排序
sort(res.begin(), res.end());
for (int i = 0; i < nums.size(); i++) {
int num = nums[i];
if (num > 0) return res;
if (i > 0 && nums[i] == nums[i - 1]) continue;
int l = i + 1;
int r = nums.size() - 1;
while (l < r) {
int sum = num + nums[l] + nums[r];
if (sum > 0) {
r--;
} else if (sum < 0) {
l++;
} else {
//如何只是实例化带元素的vector?
vector<int> temp;
temp.push_back(num);
temp.push_back(nums[l]);
temp.push_back(nums[r]);
res.push_back(temp);
while (r > l && nums[r] == nums[r - 1]) {
r--;
}
while (l < r && nums[l] == nums[l + 1]) {
l++;
}
r--;
l++;
}
}
}
return res;
}
void main_vector() {
vector<int> pa = vector<int>{-1,0,1,2,-1,-4};
threeSum(pa);
vector<int> ve;
//增
ve.push_back(1);
ve.push_back(2);
ve.push_back(3);
print_vector(ve);
//删末尾,注意判空,否则会抛异常
if (!ve.empty())
{
ve.pop_back();
}
print_vector(ve);
ve.insert(ve.begin() + 1, 11);
print_vector(ve);
//改
ve[0] = 10; //越界访问不会提示
ve[30] = 33;
ve.at(1) = 30; //越界会报错
print_vector(ve);
//删指定位置,传入迭代器。begin 代表第 0 位
ve.erase(ve.begin() + 1);
print_vector(ve);
//获得大小
ve.size();
}