【AcWing-20211203个人训练】个人题解

最新推荐文章于 2024-07-25 11:27:31 发布

FlexLian_橘友紀

最新推荐文章于 2024-07-25 11:27:31 发布

阅读量329

点赞数

分类专栏： My Problem Solution 文章标签：算法 java acm竞赛

本文链接：https://blog.csdn.net/m0_62629273/article/details/121700993

版权

My Problem Solution 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

First Problem:

52. 数组中出现次数超过一半的数字 - AcWing题库

Please forgive me, I can only solve this problem by violent way. It's true simple, just creat a HashMap in order to stock the number in array and how many times they repeated. Traverse HashMap, and find the number which repeats the most.

Following Code:

class Solution {
    public int moreThanHalfNum_Solution(int[] nums) {
        Map<Integer,  Integer> a = new HashMap<Integer, Integer>();
        for(int idx = 0;idx < nums.length;idx += 1) {
            if(!a.containsKey(nums[idx])) {
                a.put(nums[idx],1);
            } else {
                int cnt = a.get(nums[idx]);
                a.put(nums[idx],cnt + 1);
            }
        }
        int maxcnt = 0;
        int maxnum = 0;
        for(int key : a.keySet()) {
            int cnt = a.get(key);
            if(cnt > maxcnt) {
                maxcnt = cnt;
                maxnum = key;
            }
        }
        return maxnum;
    }
}

Second Problem:

63. 字符串中第一个只出现一次的字符 - AcWing题库

Just like problem before. It's also traverse String, than find the first letter that repeats once.

Following Code:

class Solution {
    public char firstNotRepeatingChar(String s) {
        Map<Character, Integer> a = new HashMap<Character, Integer>();
        for(char x : s.toCharArray()) {
            if(!a.containsKey(x)) {
                a.put(x,1);
            } else {
                int cnt = a.get(x);
                a.put(x,cnt + 1);
            }
        }
        for(char x : s.toCharArray()) {
            if(a.get(x) == 1) return x;
        }
        return '#';
    }
}