蓝桥杯(3.5)

789. 数的范围

java 复制代码
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int q = sc.nextInt();
		int[] res = new int[n];
		for(int i=0;i<n;i++)
			res[i] = sc.nextInt();
		
		while(q-- != 0) {
			int m = sc.nextInt();
			//先找左端点再找右端点
			int l = 0,r = n-1;
			while(l<r) {
				int mid = (l+r)/2;
				if(res[mid]>=m) r = mid;
				else l = mid + 1;
			}
			//l和r相等
			if(res[l] == m) {
				System.out.print(l+" ");
				//缩小搜索范围到(左端点到n-1)
				r = n-1;
				while(l<r) {
					int mid = (l+r+1)/2;//+1
					if(res[mid]<=m)	l = mid;
					else r = mid-1;
				}
				System.out.println(r);
			}else {
				System.out.println("-1 -1");
			}
		}
	}
}

790. 数的三次方根

java 复制代码
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		double n = sc.nextDouble();
		double l = -10000,r = 10000;
		while((r-l)>1e-8) {//保留6位多写两位
			double mid = (l+r)/2;
			if((mid*mid*mid) >= n)	r = mid;//!!
			else	 l = mid;
		}
		System.out.printf("%.6f",l);
	}
}

P2249 【深基13.例1】查找

java 复制代码
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;

public class Main {
	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));		
		
		String[] s1 = br.readLine().split(" ");

		int n = Integer.parseInt(s1[0]);
		int m = Integer.parseInt(s1[1]);
		
		int[] res = new int[n+1];
		String[] s2 = br.readLine().split(" ");

		for(int i=1;i<=n;i++)
			res[i] = Integer.parseInt(s2[i-1]);

		String[] s3 = br.readLine().split(" ");
		int k = 0;
		while(m-- != 0) {
			int z = Integer.parseInt(s3[k++]);
			int l = 1,r = n;
			while(l<r) {
				int mid = (l+r)/2;
				if(res[mid] >= z) r = mid;
				else l = mid + 1;
			}
			if(res[l] == z) {
				System.out.print(l+" ");
			}else {
				System.out.print("-1 ");
			}
		}
	}
}
相关推荐
小欣加油7 小时前
leetcode56 合并区间
c++·算法·leetcode·职场和发展
8Qi810 小时前
LeetCode 516:最长回文子序列
算法·leetcode·职场和发展·动态规划
moeyui70517 小时前
LeetCode 380:Insert Delete GetRandom O(1) 题解和一些延伸
算法·leetcode·职场和发展
小欣加油18 小时前
leetcode3689最大子数组总值I
c++·算法·leetcode·职场和发展·贪心算法
海梨花19 小时前
字节面试高频算法题
java·算法·面试·职场和发展
小欣加油20 小时前
leetcode121买卖股票的最佳时机
数据结构·c++·算法·leetcode·职场和发展
酉鬼女又兒21 小时前
零基础入门计算机网络:集线器与交换机区别、以太网交换机自学习转发流程及生成树协议STP全解析
服务器·网络·网络协议·tcp/ip·计算机网络·考研·职场和发展
8Qi81 天前
LeetCode 5:最长回文子串(Longest Palindromic Substring)—— 题解
算法·leetcode·职场和发展·动态规划
8Qi81 天前
LeetCode 1143 & 718:最长公共子序列 / 最长重复子数组
算法·leetcode·职场和发展·动态规划