标签：pointer int rom previous arch eee bsp put for
1、题目
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array.
Example 1:
Input: [1,3,5,6], 5 Output: 2
Example 2:
Input: [1,3,5,6], 2 Output: 1
Example 3:
Input: [1,3,5,6], 7 Output: 4
Example 4:
Input: [1,3,5,6], 0 Output: 0
2、我的解法
1 # -*- coding: utf-8 -*- 2 # @Time : 2020/2/4 16:33 3 # @Author : SmartCat0929 4 # @Email : 1027699719@qq.com 5 # @Link : https://github.com/SmartCat0929 6 # @Site : 7 # @File : 35. Search Insert Position.py 8 from typing import List 9 class Solution: 10 def searchInsert(self, nums: List[int], target: int) -> int: 11 lens=len(nums) 12 if target in nums: 13 return nums.index(target) 14 else: 15 if target < nums[-1]: 16 for i in range(lens): 17 if target < nums[i]: 18 nums.insert(i,target) 19 return nums.index(target) 20 else: 21 return lens 22 print(Solution().searchInsert([1,4,5,6,11,11],10))
The count-and-say sequence is the sequence of integers with the first five terms as following:
1. 1 2. 11 3. 21 4. 1211 5. 111221
1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read off as "one 2, then one 1" or 1211.
Given an integer n where 1 ≤ n ≤ 30, generate the nth term of the count-and-say sequence. You can do so recursively, in other words from the previous member read off the digits, counting the number of digits in groups of the same digit.
Note: Each term of the sequence of integers will be represented as a string.
Example 1:
Input: 1 Output: "1" Explanation: This is the base case.
Example 2:
Input: 4 Output: "1211" Explanation: For n = 3 the term was "21" in which we have two groups "2" and "1", "2" can be read as "12" which means frequency = 1 and value = 2, the same way "1" is read as "11", so the answer is the concatenation of "12" and "11" which is "1211".
LeetCode练题——35. Search Insert Position
标签：pointer int rom previous arch eee bsp put for
原文地址：https://www.cnblogs.com/Smart-Cat/p/12262831.html
