leetcode_practice.cpp File Reference

#include <iostream>
#include <stack>
#include <vector>
#include <map>
#include "leetcode_practice.h"
#include "array_dynamic.h"
#include "binary_tree.h"

Typedefs
typedef pair< int, int >	two_int

Functions
void	leetcode_practice ()
	leetcode_practice_array_dynamic - sub-main function More...

Typedef Documentation

two_int

typedef pair<int, int> two_int

Function Documentation

leetcode_practice()

void leetcode_practice

(

)

leetcode_practice_array_dynamic - sub-main function

{
        Array_Dynamic array_dynamic(5);
        Dynamic_Array_Exercise dynamic_array_exercise;
        Binary_Tree binary_tree;

        // Leet code - Exercise
        cout << "******** Leet code - Exercise ********" << endl;

        // 724. Find pivot index
        int array[6] = {1,7,3,6,5,9};
        vector<int> vector3(array, *(&array + 1)); // casting array
        cout << "724. Find pivot index: ";
        cout << "" << dynamic_array_exercise.pivot(vector3) << endl;

        // 747. Find the index of largest value at least Twice of Others
        cout << "747. Find the index of largest value at least Twice of Others: ";
        cout << "" << dynamic_array_exercise.dominantIndex(vector3) << endl;

        // 66. Plus one on the last matrix
        vector3 = dynamic_array_exercise.plusOne(vector3);
        cout << "66.  Plus one on the last matrix: ";
        array_dynamic.print_array_dynamic(vector3);

        // 498. Diagonal Order
        vector<vector<int>> sample = {{1, 2, 3},
                                      {4, 5, 6},
                                      {7, 8, 9}};
        vector<int> result;
        cout << "498. Diagonal order: ";
        result = dynamic_array_exercise.findDiagonalOrder(sample);
        array_dynamic.print_array_dynamic(result);

        // 54. Spiral matrix
        vector<vector<int>> sample2 = {{1, 2, 3, 2},
                                      {4, 5, 6, 2},
                                      {7, 8, 9, 2}};
        cout << "54. Spiral matrix: ";
        result = dynamic_array_exercise.spiralMatrix(sample2);
        array_dynamic.print_array_dynamic(result);

        // 118. Pascal's triangle
        int rows = 5;
        vector<vector<int>> pascal_triangle;
        pascal_triangle = dynamic_array_exercise.pachiraTringle(rows);
        cout << "118. Pascal Triangle: " << endl;
        array_dynamic.print_2d_array_dynamic(pascal_triangle);

        // 1128. Number of Equivalent Domino Pairs
        vector<vector<int>> dominoes = {{2,1},{1,2},{1,2},{1,2},{2,1},{1,1},{1,2},{2,2}};
        cout << "1128. Number of Equivalent Domino Pairs: ";
        cout << dynamic_array_exercise.numEquivDominoPairs_opt(dominoes) << endl;

        // 653. Two Sum - input is a BST
        int arr[] = { 5, 3, 6, 2, 4, 7};
        int n = sizeof(arr)/sizeof(arr[0]);
        TreeNode* root(0);
        root = binary_tree.insertNode(arr, root, 0, n);
        //binary_tree.print_inOrder(root);

        cout << "653. Two Sum IV: Input is a BST: ";
        cout << (binary_tree.findtwosumTarget(root, 10) ? "True":"False") << endl;
}

Referenced by main().