Monday, 4 May 2020

Search Insert Position | Python

Python for beginners: https://www.youtube.com/watch?v=egq7Z...

Code:


class Solution:
    def searchInsert(self, nums: List[int], target: int) -> int:
        if(target in nums):
            return nums.index(target);
        else:
            if(target<min(nums)):
                return 0;
            elif(target>max(nums)):
                return len(nums);
            else:
                g=0;
                m=0;
                while(g<len(nums)):
                    if(nums[g]>target):
                        m=g;
                        break;
                    g=g+1;
                return m;


0 Comments:

Post a comment

Popular Posts

Categories

Android (21) AngularJS (1) Assembly Language (2) Books (10) C (75) C# (4) C++ (81) Data Strucures (4) Downloads (1) Engineering (13) FPL (17) Hadoop (1) HTML&CSS (38) IS (25) Java (87) Leet Code (4) PHP (20) Python (214) R (69) Selenium Webdriver (2) Software (14) SQL (27)