C++ (Cpp) Solution::search Examples

Example #1

File: demo.cpp Project: xhwang/leetcode

int main() {

  Solution demo = Solution();
  int target;
  vector<int> nums = {3, 5, 6, 1, 2};
  target = 3;
  cout<<demo.search(nums, target)<<endl;
  target = 4;
  cout<<demo.search(nums, target)<<endl;
  target = 2;
  cout<<demo.search(nums, target)<<endl;
  return 0;
}

Example #2

File: main.cpp Project: lcxl/leetcode

int main()
{
	vector<int> nums = vector<int>({5,6,8,9,10,0,2,3});
	Solution solution = Solution();
	int index;
	
	index = solution.search(nums, 4);
	printf_s("index=%d\n", index);

	index = solution.search(nums, 1);
	printf_s("index=%d\n", index);

	index = solution.search(nums, 11);
	printf_s("index=%d\n", index);

	index = solution.search(nums, 7);
	printf_s("index=%d\n", index);

	index = solution.search(nums, 10);
	printf_s("index=%d\n", index);

	index = solution.search(nums, 6);
	printf_s("index=%d\n", index);

	index = solution.search(nums, 3);
	printf_s("index=%d\n", index);

	index = solution.search(nums, 2);
	printf_s("index=%d\n", index);
	return 0;
}

Example #3

File: 81.cpp Project: chaitanchun/person

int main()
{
    int A[] = { 2, 2, 2, 0, 2, 2 };
    Solution s;
    int re = s.search(A, 6, 0);
    return 0;
}

Example #4

File: 33-search-in-rotated-sorted-array.cpp Project: hitalex/leetcode-solutions

int main() {
    //int myint[] = {0, 1, 2, 3, 5, 7, 8, 10};
    int myint[] = {4,5,6,7,8,1,2,3};
    //int myint[] = {0, 1, 1, 2, 3, 5, 5, 7, 8, 10};
    vector<int> a(myint, myint + sizeof(myint)/sizeof(int));

    int n = a.size();
    cout << "Total: " << n << endl;
    cout << "Input s:" << endl;

    int s;
    cin >> s;
    s = s % n;
    if(s > 0) {
        flip(a, 0, n - 1);
        flip(a, 0, n-s-1);
        flip(a, n-s, n-1);
    }
    for(int i=0; i<a.size(); i++) {
        cout << a[i] << " ";
    }
    cout << endl;

    cout << "Input target:" << endl;
    int target;
    cin >> target;
    Solution solution;
    cout << solution.search(a, target) << endl;
}

Example #5

File: 33.Search in Rotated Sorted Array.cpp Project: whguo/LeetCode

int main()
{
	Solution s;
	vector<int> nums{ 4, 5, 6, 7, 0, 1, 2, 3 };
	//vector<int> nums{ 1, 3 };
	cout<<s.search(nums, 0)<<endl;
}

Example #6

File: Search in Rotated Sorted Array2.cpp Project: starsdeep/leetcode_exercise

int main(){
	int A[] = {1,1,1,1,1,1,1,3,1,1};
	Solution s = Solution();
	int target;
	while(cin>>target)
		cout << s.search(A, 10, target) << endl;
}

Example #7

File: Search_in_Rotated_Sorted_Array.cpp Project: jacky-huiyao/LeetCode

int main()
{
    int A[] = {4,5,6,7,0,1,2};
    Solution sol;
    cout<<sol.search(A,7,5)<<endl;
    return 0;
}

Example #8

File: 源.cpp Project: lisnb/leetcode

int main()
{
    Solution s;
    int num[5] = {1, 3, 1, 1, 1 };
    cout << s.search(num, 5, 3) << endl;
    system("pause");
}

Example #9

File: search_in_rotated_sorted_array.cpp Project: blizzaaard/lc2015

int main()
{
    int A[] = { 3, 4, 5, 6, 1, 2 };
    Solution s;
    std::cout << s.search(A, sizeof(A) / sizeof(A[0]), 1) << std::endl;
    return 0;
}

Example #10

File: 033.cpp Project: cblhxx/leetcode

int main() {
    Solution s;
    vector<int> nums{3,1};
    cout << s.search(nums, 1) << endl;

  return 0;
}

Example #11

File: dll.cpp Project: huangfeidian/challenge1

point_index search(SearchContext *sc, const Rect rect, const point_index count, Point *out_points)
{
    Solution* sol = (Solution*)sc;
//    rdtsc_timer timer;
    auto result = sol->search(rect, count, out_points);
//    m_times.push_back(timer.elapsed());
    return result;
}

Example #12

File: 33_search_in_rotated_array.cpp Project: guohuiGH/codes

int main () {
	int a[] = {2,3,4,5,6,7,8,9,1};
	Solution s;
	vector<int>ve(a, a+9);

	cout << s.search(ve, 3);
	return 0;
}

Example #13

File: Search in Rotated Sorted Array.cpp Project: LLouice/leetcode

int main()
{
    Solution s;
    int a[7] = {4,5,6,0,1,2,3};

    cout << s.search(a, 7, 2);
    return 0;
}

Example #14

File: searchRotatedSortedArray.cpp Project: buptqitian/leetcode

int main()
{
    Solution S;
    vector<int> nums = {4, 5, 6, 7, 0, 1, 2};
    int result = S.search(nums, 7);
    cout << result << endl;

}

Example #15

File: 81.cpp Project: DesmondWiz/Leetcode

int main()
{
    Solution slt;
    // vector<int> nums{8,8,8,8,8,8,1,1,1,1,1,1,2,2,2,2,2,2,3,4,5,6,8};
    vector<int> nums{2,2,2,0,2,2};
    cout<<slt.search(nums,2)<<endl;
    while(1);
}

Example #16

File: test.cpp Project: Vvitas/algorithm

int main()
{
	int num[]{ 1,3 };
	vector<int> data(num, num + sizeof(num) / sizeof(int));
	Solution test;
	cout << test.search(data, 0) << endl;

	return 0;
}

Example #17

File: main.cpp Project: sdkl/LeetCode

int main()
{
	Solution s;
	vector<int> nums = { 2,2,0,1,1 };
	cout << s.search(nums, 0) << endl;

	getchar();
	return 0;
}

Example #18

File: main.cpp Project: uniquews/LC

int main(int argc, const char * argv[])
{

    int A[] = {1};
    int target = 0;
    Solution su;
    cout << su.search(A, 1, target) <<endl;
    return 0;
}

Example #19

File: main2.cpp Project: leisheyoufu/study_exercise

int main()
{
    Solution sln;
    int a[] = {4, 5, 6, 7, 0, 1, 2};
    vector<int> nums(a, a+sizeof(a)/sizeof(int));
    cout << sln.search(nums,2);
    system("pause");
    return 0;
}

Example #20

File: searchrotated2.cpp Project: xiongjunliang/leetcode

int main() {
    int a[] = {1, 1, 3, 1};
    Solution s;
    int x;
    while (cin>>x) {
        cout << s.search(a, 4, x) << endl;
    }
    return 0;
}

Example #21

File: SearchinRotatedSortedArray.cpp Project: logicmd/leetcode

int main(int argc, char *argv[])
{

    Solution s;
    int a[] = {258,260,265,266,268,269,271,275,276,278,280,282,287,288,289,293,2,4,5,9,16,23,24,25,26,27,28,36,37,46,47,52,55,56,60,63,67,71,74,75,76,79,80,81,82,92,97,99,103,104,106,109,111,112,117,121,125,131,133,136,141,142,143,144,154,160,161,168,169,179,187,190,201,202,204,206,208,209,211,213,218,220,222,224,225,226,229,230,231,234,240,241,242,243,244,245,247,249,252,253,254,257};
    cout << s.search(a, 102, 81);
    system("PAUSE");
    return 0;
}

Example #22

File: 213.cpp Project: githubmsj1/Leecode

int main()
{
	int a[]={7,8,9,2,3};
	Solution s;
	cout<<s.search(a,sizeof(a)/sizeof(int),3)<<endl;


	return 0;
}

Example #23

File: SearchInArray.cpp Project: tinylcy/LeetCode

int main()
{
    vector<int> nums;
    nums.push_back(5);
    nums.push_back(1);
    nums.push_back(3);
    Solution object;
    cout<<object.search(nums,0)<<endl;
    return 0;
}

Example #24

File: SearchinRotatedSortedArrayII.cpp Project: chenshuchao/Algorithm

int main() {

    //int arr1[] = {3, 4, 6, 7, 1, 2};
    int arr1[] = {1, 3, 5};
    vector<int> v1(arr1, arr1 + sizeof(arr1)/sizeof(int));

    Solution s;
    cout << s.search(v1, 1) << endl;
    cout << s.search(v1, 4) << endl;
    cout << s.search(v1, 6) << endl;
    cout << s.search(v1, 7) << endl;
    cout << s.search(v1, 1) << endl;
    cout << s.search(v1, 2) << endl;
    cout << s.search(v1, -1) << endl;
    cout << s.search(v1, 5) << endl;
    cout << s.search(v1, 8) << endl;
    
    return 0;
}

Example #25

File: search_in_rotated_sorted_array_ii.cpp Project: K0414/xcodexp

bool test(int A[], int n, int target, bool real)
{
    Solution sol;
    bool res = sol.search(A, n, target);
    cout << "[\033[1;" << ((res == real) ? "32mPass" : "31mFail") << "\033[0m] "
         << "search([ ";
    for (int i = 0; i < n; i++)
        cout << A[i] << " ";
    cout << "], " << target << ") -> " << (res?"True":"False") << endl;
}

Example #26

File: Search in Rotated Sorted Array .cpp Project: JimberXin/Leetcode

int main(void)
{

  Solution s;
  int arr[] = {4,5,6,7,8,0,1,2,3,4};
  int result = s.search(arr,sizeof(arr)/sizeof(int),7);
  cout << result  << endl;
  getchar();
  return 0;
}

Example #27

File: main.cpp Project: leisheyoufu/study_exercise

int main()
{
    Solution sln;
    // int a[] = {1,3,3,4,5,5,7,90,101,101,102};
    int a[] = {5,1,3};
    vector<int> nums(a,a+sizeof(a)/sizeof(int));
    cout << sln.search(nums,3) << endl;
    system("pause");
    return 0;
}

Example #28

File: main.cpp Project: crazytan/LeetCode

int main()
{
	int n, target;
	int vals[100];
	cin >> n >> target;
	for (int i = 0;i < n;i++) cin >> vals[i];
	Solution solution;
	cout << solution.search(vals, n, target) << endl;
	return 0;
}

Example #29

File: 033_Search_In_Rotated_Sorted_Array.cpp Project: lilong-dream/LeetCode-Cpp

int main()
{
	int A[] = {4, 5, 6, 7, 0, 1, 2};

	Solution slt;
	std::cout << slt.search(A, 7, 1) << std::endl;
	std::cout << slt.search(A, 7, 8) << std::endl;

	return 0;
}

Example #30

File: 33.cpp Project: franktea/acm

int main()
{
	vector<int> v = //{4,5,6,7,0,1,2};
			{5,1,3};
			//{4, 5, 1, 2, 3};
	Solution* ps = new Solution;
	int index = ps->search(v, 3);
	cout<<"result="<<index<<"\n";
	return 0;
}