摘要：
1 class NumArray 2 { 3 public: 4 vector input; 5 vector dp; 6 NumArray(vector nums) 7 { 8 input = nums; 9 dp.push_back(nums[0]); 1... 阅读全文
摘要：
1 class FreqStack 2 { 3 public: 4 unordered_map hash; 5 vector stk; 6 int max_times; 7 int times_table[10001]; 8 FreqStack() 9 { 10 ... 阅读全文
摘要：
1 class Solution 2 { 3 public: 4 int surfaceArea(vector> &grid) 5 { 6 int result = 0; 7 for(auto v:grid) 8 for(auto d:v) 9 { 10 ... 阅读全文
摘要：
1 #include 2 #include 3 #include 4 #include 5 #include 6 7 using namespace std; 8 int main() 9 { 10 int T; 11 scanf("%d",&T); 12 while(T--) 13 { 14 long long in... 阅读全文
摘要：
1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 9 using namespace std; 10 int main() 11 { 12 int N; 13 string HDU = "HDU"; 14 while(cin >> ... 阅读全文
摘要：
1 #include 2 3 int trap(int* height, int heightSize) 4 { 5 int rains = 0; 6 if(heightSize==0) 7 return rains; 8 int leftmax = 0,rightmax = 0; 9 int left = 0,right ... 阅读全文
摘要：
1 #include 2 #include 3 int main (void) 4 { 5 int a[1001], len; 6 int i; 7 int arc; 8 int j; 9 while(scanf("%d", &len)!= EOF){ 10 arc = 0; 11 for(i ... 阅读全文
摘要：
1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 8 9 bool FindYourMiku(char **board,char *MIKU,int cur_x,int cur_y,int sizeRow,int sizeCol,int MikuStart) 10 { 11... 阅读全文
摘要：
1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 int max(int a,int b) 8 { 9 return a>b?a:b; 10 } 11 12 int maxDestroy(int* nums, int numsSize) { 13 int arr... 阅读全文
摘要：
1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #define MAX 1500 8 9 struct TreeNode 10 { 11 int val; 12 struct TreeNode *left; 13 struct... 阅读全文