81. Search in Rotated Sorted Array II

-

// Approach 1 Linear Search

 class Solution {

public:

    bool search(vector<int>& nums, int target) {

        

        for(int i=0;i<nums.size();i++){

            if(nums[i]==target)

                return true;

        }

};


Approach 2 Binary Search

First find pivot and select the portion where to move

Comments

Post a Comment

Popular posts from this blog

160. Intersection of Two Linked Lists

-
Question Given the heads of two separately linked lists headA and headB , return the node at which the two lists intersect. If the two linked lists do not intersect at all, return null. For example, the following two linked lists begin to intersect at node c1: Test cases are generated in such a way that there are no loops anywhere in the entire linked structure. Note that linked lists must retain their original structure when the function returns. Own referee: The inputs for the referee are as follows (your program will not receive these inputs): intersectVal - The value of the node where the intersection occurs. This is 0 if there is no intersecting node. listA - The first linked list. listB - Second linked list. skipA - The number of nodes to skip forward in list A (starting from the beginning) to reach the intersected node. skipB - The number of nodes to skip forward in list B (starting from the beginning) to reach the intersecting node. The arbiter then...
Read more

67. Add Binary

-
Add Binary   (C++) class Solution { public : string addBinary ( string a, string b ) { string ans= "" ; int carry= 0 ; while (a.size()||b.size()) { int x= 0 ,y= 0 ; if (a.size()){ x=a.back()- '0' ; a.pop_back(); } if (b.size()){ x+=b.back()- '0' ; b.pop_back(); } x+=carry; if (x== 1 ){ans+= '1' ;carry= 0 ;} if (x== 0 )ans+= '0' ; if (x== 2 ){ans+= '0' ;carry= 1 ;} if (x== 3 ){ans+= '1' ;carry= 1 ;} } if (carry)ans+= '1' ; reverse(ans.begin(),ans.end()); return ans; } };
Read more

88. Merge Sorted Array

-
C++ | Simplest Way | Brute Force class Solution { public: void merge(vector& nums1, int m, vector& nums2, int n) { int i = m- 1 , j = n- 1 , index = m+n- 1 ; while (i>= 0 && j>= 0 ){ if (nums1[i]>nums2[j]) nums1[index--] = nums1[i--]; else nums1[index--] = nums2[j--]; } while (i>= 0 ) nums1[index--] = nums1[i--]; while (j>= 0 ) nums1[index--] = nums2[j--]; } };
Read more