1.给一个非严格递增整数数组,查找某个给定的数第一次出现的下标
二分查找
public static int searchInsert(int[] nums, int target) {
int low=0;
int high=nums.length-1;
while(low<=high)
{
int mid=low+(high-low)/2;
if(nums[mid]==target)
{
if(mid>=1&&nums[mid-1]!=target)
{
return mid;
}
else
{
high=mid-1;
}
}
else if(nums[mid]<target)
{
low=mid+1;
}
else if(nums[mid]>target)
{
high=mid-1;
}
}
return -1;//target不在数组里返回-1
}
2.Python熟悉吗?
3.对Liunx命令熟悉吗?
4.liunx文件一行一个整数,用命令将文件内数字排序
https://www.cnblogs.com/lomoye/p/5862326.html
5.SVM和逻辑回归的区别
https://blog.csdn.net/jieming2002/article/details/79317496
6.微博分类(给一条微博,用什么算法将它分类)