int main()
{
	Solution s ;
	int a[]={2,5,3,1, 6};
	vector<int> input(a,a+sizeof(a)/sizeof(a[0]));
	s.maxArea(input);
}
Example #2
0
int main() {
  // std::vector<int> h = {1, 8, 6, 2, 5, 4, 8, 3, 7};
  std::vector<int> h = {2, 3, 4, 5, 18, 17, 6};
  Solution s;
  printf("%d\n", s.maxArea(h));
  return 0;
}
int main_containerWithMostWater(int argc, const char *argv[]) {
    vector<int> input = {1, 1};
    Solution s;
    int area = s.maxArea(input);
    cout << "area = " << area << endl;
    return 0;
}
int main(int argc, char const *argv[])
{
	std::vector<int> v={1,2,3,4,5,6,7,7};
	Solution so;
	cout<<so.maxArea(v)<<endl;
	return 0;
}
int main() {
  int a[] = {1, 2};
  vector<int> hs(a, a + sizeof(a)/sizeof(int));
  Solution sol;
  cout << sol.maxArea(hs) << endl;
  return 0;
}
int main()
{
    vector<int> A({0, 2, 3, 1});
    Solution sln;
    cout<<sln.maxArea(A)<<endl;
    return 0;
}
int main(){
    Solution sol;
    int pp[]={3,7,10,100,500};
    vector<int> height(pp, pp + sizeof(pp)/sizeof(int) );
    cout << sol.maxArea(height) << endl;
    return 0;
}
Example #8
0
int main()
{
    Solution s;
    vector<int> v;
    v.push_back(1);
    v.push_back(1);
    cout << s.maxArea( v );
}
int main() {
    vector<int> height;
    height.push_back(1);
    height.push_back(1);
    Solution solution;
    cout << solution.maxArea(height) << endl;
    return 0;
}
int main()
{
	int arr[5] = {1,2,3,4,5};
	vector<int> height( arr, arr+5 );
	Solution sol;
	cout << sol.maxArea( height ) << endl; 
	return 0;
}
Example #11
0
File: main.cpp Project: uniquews/LC
int main(int argc, const char * argv[])
{

    vector<int> ex = {0,2};
    Solution su;
    cout << su.maxArea(ex);
    return 0;
}
Example #12
0
int main(){
	int arr[] = { 1, 2, 1 };
	int max;
	vector<int> v(arr, arr + 3);
	Solution s;
	max=s.maxArea(v);
	getchar();
	return 0;
}
int main()
{
	Solution sol;
	int arr[] = {1,2,4,5,3,6,9,8,7};
	vector<int> ht(arr,arr+9);
	int ans=sol.maxArea(ht);
	cout<<ans<<endl;
	return 0;
}
int main(){
	Solution s;
	vector<int> v;
	v.push_back(1);
	v.push_back(2);
	v.push_back(1);
	cout << s.maxArea(v) << endl; 
	return 0; 
}
Example #15
0
 int main(){
 	vector<int>v = {0,1,0,2,1,0,1,3,2,1,2,1};
 	/*v.push_back(9);
 	v.push_back(2);
 	v.push_back(9);
 	v.push_back(0);
 	//v.push_back(4);*/
 	Solution obj;
 	cout<<obj.maxArea(v)<<endl;
 }
int main(){
        Solution s;
        vector<int> array ={1,2,3,4,5};
        copy(array.begin(),array.end(),ostream_iterator<int>(cout," "));
		cout<<endl;
        int area = s.maxArea(array);
		cout<<area<<endl;
        return 0;

}
Example #17
0
int main()
{
    vector<int>   ivec = {1,3,4,5,5,3};
    Solution s;
    cout << s.maxArea(ivec)<<endl;


    system("pause");
    return 0;
}
Example #18
0
int main()
{
   cout << "Hello World" << endl; 
  
   Solution sol; 
   
   vector<int> vec = {1 , 1};
   cout << sol.maxArea(vec) << endl; 

   return 0;
}
int main(){
    Solution s;
    vector<int> height;
    height.push_back(1);
    height.push_back(5);
    height.push_back(2);
    height.push_back(3);
    height.push_back(2);
    cout << s.maxArea(height) << endl;
    return 0;
}
int main()
{
	Solution s;
	int a[] = {2, 1};
	vector<int> f;
	for (int i = 0; i < 2; ++i)
	{
		f.push_back(a[i]);
	}
	cout<<s.maxArea(f)<<endl;
	return 0;
}
int main(int argc, char **argv) {
    int n;
    scanf("%d", &n);
    vector<int> height;
    for (int i = 0; i < n; i++) {
        int x;
        scanf("%d", &x);
        height.push_back(x);
    }
    Solution s;
    printf("%d\n", s.maxArea(height));
    return 0;
}
Example #22
0
int main() {
    Solution s;
    vector<int> h;
    h.push_back(1);
    h.push_back(2);
    h.push_back(3);
    h.push_back(3);
    h.push_back(2);
    h.push_back(1);
    int res = s.maxArea(h);
    std::cout << res << std::endl;

    return 0;
}
Example #23
0
int main(int argc, char *argv[])
{
	Solution sol;
	vector<int> h;

	h.push_back(1);
	h.push_back(2);
	h.push_back(3);
	h.push_back(4);

	cout << sol.maxArea(h) << endl;

	return 0;
}
Example #24
0
int main()
{
    vector<int> height;
    height.push_back(1);
    height.push_back(2);
    height.push_back(3);
    height.push_back(4);
    height.push_back(100);
    height.push_back(100);
    Solution so;
    cout << so.maxArea(height) << endl;

    return 0;
}
int main(){
    int n, m;
    Solution s;
    while(1){
        vector<int> h;
        cin >> n;
        while(n--){
            cin >> m;
            h.push_back(m);
        }
        cout << s.maxArea(h) << endl;
    }
    return 0;
}
Example #26
0
int main() {
    Solution s;
    vector<int> height;
    height.push_back(1);
    height.push_back(4);
    height.push_back(2);
    height.push_back(4);
    height.push_back(6);
    height.push_back(7);
    int maxArea = s.maxArea(height);
    cout << "function1 maxArea: " << maxArea << endl;
    
    cout << "function2 maxArea: " << s.maxArea2(height) << endl;

}
Example #27
0
int main(int argc, char const *argv[])
{
	Solution solution;
	vector <int> hight;
	hight.push_back(2);
	hight.push_back(3);
	hight.push_back(10);
	hight.push_back(5);
	hight.push_back(7);
	hight.push_back(8);
	hight.push_back(9);
	int result=solution.maxArea(hight);
	cout<<result<<endl;
	return 0;
}
int main(int argc, const char * argv[]) {
    Solution s = Solution();
    vector<int> height;
    height.push_back(1);
    height.push_back(8);
    height.push_back(6);
    height.push_back(2);
    height.push_back(5);
    height.push_back(4);
    height.push_back(8);
    height.push_back(3);
    height.push_back(7);

    cout << s.maxArea(height) << '\n';

}
Example #29
0
int main()
{

    int N,t;
    cin >> N >> t;
    vector<int> v;
    int tmp;
    for(int i=0;i<N;i++)
    {
        cin >> tmp;
        v.push_back(tmp);
    }
    Solution s;
    //vector<int> ans = s.twoSum(v,t);
    //cout << ans[0] <<' ' << ans[1] << endl;
    cout << s.maxArea(v) << endl;;
}
Example #30
0
int main()
{
    Solution solution;
    
    //Test cases
    {
        int a[] = {3, 8, 3, 4, 6};
        vector<int> v;
        INT_ARR_TO_VEC(v, a);

        cout << solution.maxArea(v) << endl;
    }
	
    //Error test cases from leetcode.com
	
	return 0;
}