2022-1-6 Niuke net brush sword finger offer

JZ53 The number of times a number appears in an ascending array

error ：class Solution {
public:
int GetNumberOfK(vector data ,int k) {
// Bubble sort
error 1// if(!data) return -1;
error 2// if(data.size==0) return -1;
int ans=0;
for(int i=0; i<data.size(); ++i){
// as long as data[i] And k equal ,ans++
//data[i]>k when break Stop the cycle
if(data[i] == k) ans++;
if(data[i]>k) break;
}
return ans;
}
};
error 1：
error 2： When the input is two parameters ,1 Is an array ,2 For the number to find in the array . About whether the two are empty 4 In this case ：1 empty 2 empty ,1 empty 2 Not empty ,1 Not empty 2 empty ,1 Not empty 2 Not empty . In this question, you find numbers in an array , If 1 empty , It doesn't matter 2 How many , Will not find , No special treatment . If 1 Not empty ,2 There is no special treatment for several .

Insert picture description here

error 1： Calculation mid Should be mid = l+(r-l)/2
The mistake is mid = l+(l-r)/2 Insert picture description here

The official solution code is as follows

JZ11 Minimum number of rotation array

error ： You should not set the minimum value yourself , Instead, a value in the array is used as the starting value .

JZ10 Fibonacci sequence

error ： Logic error , If 0 or 1, Push the 1, Other situations , Push the vi[i-1] + vi[i-2]

JZ42 The maximum sum of successive subarrays

error ：vector Assignment cannot be used dp[0]= Should use the dp.push_back(