Force buckle 599 Minimum index sum of two lists

599. The minimum index sum of two lists

hypothesis Andy and Doris Want to choose a restaurant for dinner , And they all have a list of their favorite restaurants , The name of each restaurant is represented by a string .

You need to help them use the least index and find their favorite restaurants . If there is more than one answer , Then all the answers are output regardless of the order . You can assume that the answer always exists .

Knowledge points involved ：

Dictionaries

Code section

class Solution:
    def findRestaurant(self, list1: List[str], list2: List[str]) -> List[str]:
        favorite_restaurant={
    }
        min_f=[]
        for x in list1:
            if x in list2:
                favorite_restaurant[x]=list2.index(x)+list1.index(x)
        minv=min(favorite_restaurant.values())
        for i,j in favorite_restaurant.items():
            if j==minv:
                min_f.append(i)

        return min_f

674. The longest continuous increasing sequence

Given an unordered array of integers , Find the longest and Successive increasing subsequences , And return the length of the sequence .

Successive increasing subsequences It can be made up of two subscripts l and r（l < r） determine , If for each l <= i < r, There are nums[i] < nums[i + 1] , So the subsequence [nums[l], nums[l + 1], …, nums[r - 1], nums[r]] It's a continuous increasing subsequence .

### Knowledge points involved
Dynamic programming

class Solution:
    def findLengthOfLCIS(self, nums: List[int]) -> int:
        ans=[1 for _ in range(len(nums))]
        for i in range(1,len(nums)):
            if nums[i]>nums[i-1]:
                ans[i]=ans[i-1]+1
        return max(ans)

2319. Judge whether the matrix is a X matrix

If a square matrix satisfies the following All Conditions , It is called a X matrix ：

 All the elements on the diagonal of the matrix are   No  0
 All other elements in the matrix are  0

Give you a size of n x n A two-dimensional array of integers grid , Represents a square matrix . If grid It's a X matrix , return true ; otherwise , return false .

Knowledge points involved ：

Two dimensional matrix for loop

Code section

class Solution:
    def checkXMatrix(self, grid: List[List[int]]) -> bool:
        for i in range(len(grid[0])):
            for j in range(len(grid)):
                if i==j or len(grid)-j-1==i :
                    if grid[i][j]==0:
                        return False
                else:
                    if (grid[i][j]!=0):
                        return False
        return True

989. The addition of integers in the form of arrays

The integer Array form num Is an array of numbers in left to right order .

 for example , about  num = 1321 , The array form is  [1,3,2,1] .

Given num , The integer Array form , And integer k , return Integers num + k Of Array form .

Knowledge points involved

String conversion

class Solution:
    def addToArrayForm(self, num: List[int], k: int) -> List[int]:
        return [int(i) for i in str((int(str(num)[1:-1:3]))+k)]

class Solution:
    def addToArrayForm(self, A: List[int], K: int) -> List[int]:
        return list(map(int,str(int(''.join(map(str,A))) + K)))