HowlandDong的博客

#include <vector>#include <iostream>#include <algorithm>using namespace std;int main(int argc, char **argv) { vector<int> digits; digits.push_back(9); std::vector<int>::iterator end; end=digi

题目Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].代码#include <algorithm>#include <iostream>#include <v

题目Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn’t matter what you leave beyond the new length.代码#inclu

leetcode 题目 3Sum

#include <sys/time.h>#include <algorithm>#include <iostream>#include <unordered_set>#include <vector>using namespace std;bool containsDuplicate(vector<int>& nums) { unordered_set<int> us; for( a