1 #ifndef ARRAY_LEETCODE_PRACTICE_H_ 2 #define ARRAY_LEETCODE_PRACTICE_H_ 13 int pivot(vector<int> & nums);
14 int dominantIndex(vector<int> &nums);
15 vector<int> plusOne(vector<int> &nums);
16 vector<int> findDiagonalOrder (vector<vector<int>> &matrix);
17 vector<int> spiralMatrix(vector<vector<int>> & matrix);
18 vector<vector<int>> pachiraTringle(
int numRows);
19 int numEquivDominoPairs(vector<vector<int>>& dominoes);
20 int numEquivDominoPairs_opt(vector<vector<int>>& dominoes);
Definition: leetcode_practice.h:8
void leetcode_practice()
leetcode_practice_array_dynamic - sub-main function
Definition: leetcode_practice.cpp:15