刷题日记（2）

最新推荐文章于 2024-06-16 09:46:44 发布

Wztdx

最新推荐文章于 2024-06-16 09:46:44 发布

阅读量50

点赞数

文章标签： java 开发语言

本文链接：https://blog.csdn.net/wztdx/article/details/130311130

版权

OR59 字符串中找出连续最长的数字串

import java.util.Scanner;


public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        String str = scan.nextLine();
        String ret = "";
        String cur = "";
        int i = 0;

        for (; i < str.length(); i++) {
            char ch = str.charAt(i);
            if (ch >= '0' && ch <= '9') {
                cur = cur + ch ;
            } else {
                if (ret.length() < cur.length()) {
                    ret = cur;
                }
                cur = "";
            }
        }
        //处理123abc123456这种情况
        if (i == str.length() && ret.length() < cur.length()) {
            ret = cur;
        }
        System.out.print(ret);
    }
}

JZ39 数组中出现次数超过一半的数字


import java.util.HashMap;
import java.util.Map;
public class Solution {
    public int MoreThanHalfNum_Solution(int [] array) {

        Map<Integer, Integer> map = new HashMap<>();
        int length = array.length;
        for (int i = 0; i < array.length; i++) {
            if (map.containsKey(array[i])) {
                int temp = map.get(array[i]);
                temp++;
                map.put(array[i], temp);
            } else {
                map.put(array[i], 1);
            }
        }

        int num = -1;
        for (int i = 0; i < array.length; i++) {
            if (map.get(array[i]) > length / 2) {
                num = array[i];
            }

        }
        return num;


    }
}