算法
This commit is contained in:
@@ -0,0 +1,19 @@
|
||||
#pragma once
|
||||
#include <iostream>
|
||||
#include <map>
|
||||
|
||||
namespace yaha {
|
||||
class Array {
|
||||
public:
|
||||
void merge(std::vector<int>& nums1, int m, std::vector<int>& nums2, int n);
|
||||
int remove_element(std::vector<int>& nums, int val);
|
||||
int remove_duplicates(std::vector<int>& nums);
|
||||
int remove_duplicates2(std::vector<int>& nums);
|
||||
|
||||
int majority_element(std::vector<int>& nums);
|
||||
|
||||
void rotate(std::vector<int>& nums, int k);
|
||||
|
||||
int max_profit(std::vector<int>& prices);
|
||||
};
|
||||
}
|
||||
Reference in New Issue
Block a user