C++ (Cpp) Solution::searchInsert Examples

Example #1

File: main.cpp Project: bitmingw/LintcodeSolution

int main() {
    Solution s;
    int arr[] = {1, 3, 5, 6};
    vector<int> vec(arr, arr+4);
    cout << s.searchInsert(vec, 5) << s.searchInsert(vec, 2) << s.searchInsert(vec, 7) << s.searchInsert(vec, 0) << endl;
    // should be 2140
	return 0;
}

Example #2

File: Search_Insert_Position.cpp Project: laosiaudi/leetcode

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

Example #3

File: Search_Insert_Position.cpp Project: LixinZhang/Interview-Question

int main(){
    Solution s;
    int arr[] = {1,3,5,6};
    cout << s.searchInsert(arr, 4, 5) << endl;
    cout << s.searchInsert(arr, 4, 2) << endl;
    cout << s.searchInsert(arr, 4, 7) << endl;
    cout << s.searchInsert(arr, 4, 0) << endl;
    return 0;
}

Example #4

File: 035_Search_Insert_Position.cpp Project: FanZhitao/LeetCode

void main()
{
    Solution s;
    vector<int> v1 = { 1,3,5,6 };
    cout << s.searchInsert(v1, 5) << endl;
    cout << s.searchInsert(v1, 2) << endl;
    cout << s.searchInsert(v1, 7) << endl;
    cout << s.searchInsert(v1, 0) << endl;
}

Example #5

File: search-insert-position.cpp Project: aarzho/LeetCode-1

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

    return 0;
}

Example #6

File: LEET_SEARCH_INSERT_POSITION.cpp Project: cshung/Competition

int LEET_SEARCH_INSERT_POSITION()
{
    int case1_array[] = { 1, 3, 5, 6 };
    vector<int> case1(case1_array, case1_array + _countof(case1_array));
    Solution s;
    cout << s.searchInsert(case1, 5) << endl;
    cout << s.searchInsert(case1, 2) << endl;
    cout << s.searchInsert(case1, 7) << endl;
    cout << s.searchInsert(case1, 0) << endl;
    return 0;
}

Example #7

File: SearchInsertPosition.cpp Project: fishpj/leetcode

int main(int argc, char *argv[])
{
	int A[] = {1, 3, 5, 6};
	Solution so;
	std::cout << so.searchInsert(A, 4, 5) << std::endl;
	std::cout << so.searchInsert(A, 4, 2) << std::endl;
	std::cout << so.searchInsert(A, 4, 7) << std::endl;
	std::cout << so.searchInsert(A, 4, 0) << std::endl;

	return 0;
}

Example #8

File: 35-SearchInsertPosition.cpp Project: goaxe/Algorithm

int main() {
    vector<int> nums;
    nums.push_back(1);
    nums.push_back(3);
    nums.push_back(5);
    nums.push_back(6);

    Solution solution;
    cout << solution.searchInsert(nums, 5) << endl;
    cout << solution.searchInsert(nums, 2) << endl;
    cout << solution.searchInsert(nums, 7) << endl;
    cout << solution.searchInsert(nums, 0) << endl;
}

Example #9

File: main.cpp Project: sdkl/LeetCode

int main()
{
	Solution s;
	int arr[] = {1,3,5,6};
	int size = sizeof(arr) / sizeof(arr[0]);
	vector<int> p(arr, arr + size);
	cout << s.searchInsert(p, 5) << endl;
	cout << s.searchInsert(p, 2) << endl;
	cout << s.searchInsert(p, 7) << endl;
	cout << s.searchInsert(p, 0) << endl;

	getchar();
	return 0;
}

Example #10

File: 35SearchInsertPosition.cpp Project: Edward-surpass/brushCode

int main(int argc, char *argv[])
{
    vector<int> nums= {1,3,5,6};
    Solution so;
    cout << so.searchInsert(nums,0) << endl;
    return 0;
}

Example #11

File: 35.cpp Project: hrh007/leetcode-1

int main()
{
    int a[]={1,3,5,6};
    Solution s;
    cout<<s.searchInsert(a,4,0)<<endl;
    return 0;
}

Example #12

File: 35-Search Insert Position.cpp Project: Will-Z/algorithm-practice

int main() {
    int a[] = {1,3,5,7};
    vector<int> nums(a, a + 4);
    Solution test;
    cout<<test.searchInsert(nums, 8)<<endl;
    return 0;
}

Example #13

File: Search_Insert_Position.cpp Project: Gavinthisisit/Codes

int main(){
	int a[] = {3,5,7,9,10};
	vector<int> vec(a,a+5);
	Solution s;
	cout<<s.searchInsert(vec,8);
	return 0; 
} 

Example #14

File: binary_search.cpp Project: nitinb/Codes

int main() {
    Solution *sol = new Solution();
    int arr[] = {1, 3, 5};
    int key = 4;
    int num = sol->searchInsert(arr, sizeof(arr)/sizeof(int), key);
    std::cout << num << std::endl;
}

Example #15

File: search-insert-position.cpp Project: xuqiang/leetcode

int main(int argc, char* argv[]) {
	vector<int> nums = { 1 };
	const int target = 2;
	Solution s;
	cout << s.searchInsert(nums, target) << endl;
	return 0;
}

Example #16

File: 15 Search Insert Position.cpp Project: i-sunny/leet_code

int main()
{
    int a[] = {1,2,4,5,6};
    int sz = sizeof(a)/sizeof(int);
    Solution test;
    cout << test.searchInsert(a, sz, 4) << endl;
}

Example #17

File: search_insert_position.cpp Project: elden2010/leetcode

int main() {

    Solution s;
    int A[] = {1,3,5,6};

    cout << s.searchInsert(A,4,0) << endl;
}

Example #18

File: Search Insert Position.cpp Project: glf3/LeetCode

int main()
{
	int A[10] = {1, 3, 5, 6};
	printf("%d\n", g.searchInsert(A, 4, 2));
	system("pause");
	return 0;
}

Example #19

File: 035-search-insert-position.cpp Project: duxins/leetcode

TEST(leetcode_035_search_insert_position, Basic)
{
    Solution * solution = new Solution();
    vector<int> nums = {1, 3, 5, 6};
    EXPECT_EQ(2, solution->searchInsert(nums, 5));
    EXPECT_EQ(1, solution->searchInsert(nums, 2));
    EXPECT_EQ(4, solution->searchInsert(nums, 7));
    EXPECT_EQ(0, solution->searchInsert(nums, 0));

    nums = {1};
    EXPECT_EQ(1, solution->searchInsert(nums, 2));
    EXPECT_EQ(0, solution->searchInsert(nums, 0));

    nums = {};
    EXPECT_EQ(0, solution->searchInsert(nums, 10));
}

Example #20

File: torresng.cpp Project: nothingbutu/LeetCode

int main(void) {
	Solution s = Solution();

    vector<int> nums {1,3,5,6};
    int target = 5;
	cout << "Input: [1,3,5,6], 5: " << s.searchInsert(nums, target) << endl;

    target = 2;
	cout << "Input: [1,3,5,6], 2: " << s.searchInsert(nums, target) << endl;

    target = 7;
	cout << "Input: [1,3,5,6], 7: " << s.searchInsert(nums, target) << endl;

    target = 0;
	cout << "Input: [1,3,5,6], 0: " << s.searchInsert(nums, target) << endl;
	return 0;
}

Example #21

File: SearchInsertPosition.cpp Project: bojifengyu/LeetCode

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

Example #22

File: leetcode_Search_Insert_Position.cpp Project: monkeylyf/interviewjam

int main() {
  Solution sol;

  vector<int> nums {1, 3};

  int target = 2;
  int res = sol.searchInsert(nums, target);
  printf("target: %d -> res: %d\n", target, res);
}

Example #23

File: 35_Search_Insert_Position.cpp Project: ningfengh/practice

int main(void)
{

	int a[]={3,4,6,8,10};
	Solution mysolution;
	vector<int>  vec_a(a,a+5);
	cout<<mysolution.searchInsert(vec_a, 11)<<endl;

}

Example #24

File: Solution.cpp Project: shipengAlan/leetcode

int main(){
    Solution s;
    vector<int> input;
    input.push_back(1);
    input.push_back(3);
    input.push_back(5);
    input.push_back(6);
    cout<<s.searchInsert(input,4);
}

Example #25

File: Search Insert Position.cpp Project: JimberXin/Leetcode

int main(void)
{
  int arr[] = {6};
  Solution s;
  int index = s.searchInsert (arr,sizeof(arr)/sizeof(int),10);
  cout << index << endl;
  getchar();
  return 0;
}

Example #26

File: 35.cpp Project: DesmondWiz/Leetcode

int main()
{
	// vector<int> nums{0,1,2,3,4,5,7,8,9,10,11};
	vector<int> nums{1};
	int target = 2;
	Solution slt;
	cout<<slt.searchInsert(nums,target)<<endl;
	while(1);
}

Example #27

File: SearchPosition.cpp Project: tinylcy/LeetCode

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

Example #28

File: search.cpp Project: xbz/leetcode

// sumbit 3 times to accept.
int main(int argc, char *argv[])
{
    Solution s;
    int arr[] = { 2, 5 };
    int len = sizeof(arr) / sizeof(arr[0]);
    int elem = 8;
    int pos = s.searchInsert(arr, len, elem);

    cout << "pos:" << pos << endl;
    return 0;
}

Example #29

File: insertPosition.cpp Project: dheerajkhatri/bajinga

int main(){

	vector<int> vec;
	vec.push_back(1);
	vec.push_back(3);
	vec.push_back(5);
	vec.push_back(6);
	//vec.push_back();
	Solution obj;
	cout<<obj.searchInsert(vec,0)<<endl;
	return 0;
}

Example #30

File: searchInsertPosition.cpp Project: IrishCoffee/AlgorithmCode

int main()
{
	int target;
	int A[64];
	int n;
	cin >> n;
	for(int i = 0; i < n; ++i)
		cin >> A[i];
	cin >> target;
	Solution sol;
	cout << sol.searchInsert(A,n,target) << endl;
	return 0;
}