【Java笔试强训】day5编程题

编程题

统计回文

在这里插入图片描述

import java.util.Scanner;

@SuppressWarnings("all")
public class Main {
    
    
    public static void main(String[] args) {
    
    
        Scanner sc = new Scanner(System.in);
        String s1 = sc.nextLine();
        String s2 = sc.nextLine();

        int count = 0;
        for (int i = 0; i <= s1.length(); i++) {
    
    
            StringBuffer str = new StringBuffer(s1);
            str.insert(i, s2);
            StringBuffer tmp = new StringBuffer(str);
            StringBuffer stringBuffer = tmp.reverse();
            if (stringBuffer.toString().equals(str.toString())) {
    
    
                count++;
            }
        }
        System.out.print(count);
    }


    public static boolean isHuiwen(String s) {
    
    
        int left = 0;
        int right = s.length() - 1;
        while (left <= right) {
    
    
            if (s.charAt(left) == s.charAt(right)) {
    
    
                return true;
            }
            left++;
            right--;
        }
        return false;
   }
}

连续最大和

在这里插入图片描述

import java.util.Scanner;

@SuppressWarnings("all")
public class Main {
    
    

    public static void man(String[] args) {
    
    
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] array = new int[n];
        for (int i = 0; i < array.length; i++) {
    
    
            array[i] = sc.nextInt();
        }
        int sum = array[0];
        int max = array[0];
        for (int i = 0; i < array.length; i++) {
    
    
            sum = Math.max(sum + array[i], array[i]);
            if (sum >= max) {
    
    
                max = sum;
            }
        }
        System.out.println(max);
    }

猜你喜欢

转载自blog.csdn.net/weixin_61341342/article/details/129744154