9.20 度小满笔试

r囧r小猫 2022-12-08 15:55 125阅读 0赞

# 1. 第一题： #

## 题目： ##

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3p5eF9seQ_size_16_color_FFFFFF_t_70_pic_center]

## 1. 代码一： ##

import java.util.*;
    
    public class Main1_1 { 
        public static void main(String[] args) { 
            Scanner sc = new Scanner(System.in);
            String s = sc.next(); // 小A手上的颜料
            String t = sc.next(); // 画画需要的燃料
    
            Map<Character, Integer> map1 = new HashMap<>();
            for(int i = 0; i < s.length(); i++)
            { 
                map1.put(s.charAt(i), map1.getOrDefault(s.charAt(i), 0) + 1);
            }
    
            Map<Character, Integer> map2 = new HashMap<>();
            for(int i = 0; i < t.length(); i++)
            { 
                map2.put(t.charAt(i), map2.getOrDefault(t.charAt(i), 0) + 1);
            }
    
    // for(Map.Entry<Character, Integer> entry : map1.entrySet())
    // { 
    // System.out.println("Key = " + entry.getKey() + ", Value = " + entry.getValue());
    // }
    //
    // System.out.println("****************************************");
    //
    // for(Map.Entry<Character, Integer> entry : map2.entrySet())
    // { 
    // System.out.println("Key = " + entry.getKey() + ", Value = " + entry.getValue());
    // }
    
            int count = 0;
    
            for(int i = 0; i < t.length(); i++)
            { 
    // System.out.println(map1.get(t.charAt(i)));
                if(map1.get(t.charAt(i)) != null && map1.get(t.charAt(i)) > 0)
                { 
                    map1.put(t.charAt(i), map1.get(t.charAt(i)) - 1);
                    count++;
                }
            }
    
            System.out.println(count);
        }
    }
    
    //输入:
    //AAB
    //ABC
    //
    //输出:
    //2

## 2. 代码二： ##

import java.util.*;
    
    public class Main1_2 { 
        public static void main(String[] args) { 
            Scanner sc = new Scanner(System.in);
            String s = sc.next(); // 小A手上的颜料
            String t = sc.next(); // 画画需要的燃料
    
            int len1 = s.length();
            int len2 = t.length();
    
            int res = 0;
    
            int count[] = new int[26];
    
            for(int i = 0; i < len1; i++)
            { 
                count[s.charAt(i) - 'A']++;
            }
    
            int cur;
            for(int i = 0; i < len2; i++)
            { 
               cur = t.charAt(i) - 'A';
               if(count[cur] > 0)
               { 
                   count[cur]--;
                   res++;![在这里插入图片描述](https://img-blog.csdnimg.cn/20200921005138304.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3p5eF9seQ==,size_16,color_FFFFFF,t_70#pic_center)
    
               }
            }
    
            System.out.println(res);
        }
    }
    
    //输入:
    //AAB
    //ABC
    //
    //输出:
    //2

# 2. 第二题： #

## 题目： ##

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3p5eF9seQ_size_16_color_FFFFFF_t_70_pic_center 1]

## 代码： ##

#include <bits/stdc++.h>
    #define ll long long
    using namespace std;
    char a[1005][1005];
    int dp[1005][1005];
    int ans,t,n,m;
    void dfs(int x,int y,int value) { 
      if (value >= dp[x][y] || value >= ans || a[x][y] == '#') { 
          return;
      }
      dp[x][y] = value;
      if (x == 0 || x == n-1 || y == 0 || y == m-1) { 
          ans = min(ans,value);
          return;
      }
      dfs(x+1,y,value + (a[x+1][y] == '*'));
      dfs(x-1,y,value + (a[x-1][y] == '*'));
      dfs(x,y+1,value + (a[x][y+1] == '*'));
      dfs(x,y-1,value + (a[x][y-1] == '*'));
    }
    int main(){ 
      scanf("%d",&t);
      while (t--) { 
          memset(dp,0x3f,sizeof(dp));
          ans = 1e9+7;
          scanf("%d%d",&n,&m);
          for (int i = 0;i < n;i++)
              scanf("%s",a[i]);
          int sx = -1,sy;
          for (int i = 0;i < n && sx < 0;i++){ 
              for (int j = 0;j < m && sx < 0;j++) { 
                  if (a[i][j] == '@') { 
                      sx = i;
                      sy = j;
                  }
              }
          }
          dfs(sx,sy,0);
          printf("%d\n", ans == 1e9+7 ? -1 : ans);
      }
      return 0;
    }

# 3. 参考： #

1.  [度小满金融笔试][Link 1]
2.  [9.20度小满Java岗2道算法题][9.20_Java_2]
3.  [度小满9/20 Java岗笔试AK][9_20 Java_AK]
4.  [度小满金融2020/9/20笔试][2020_9_20]
5.  [0920度小满笔试，记录自己的脑抽][0920]
6.  [9.20 度小满金融测试开发笔试Python题解][9.20 _Python]
7.  [度小满金融9.20算法笔试AC情况][9.20_AC]
8.  [度小满0920笔试2AC答案 基础架构研发工程师][0920_2AC_]
9.  [9.20度小满第二个编程][9.20]
10. [度小满 9.20笔试][9.20 1]

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3p5eF9seQ_size_16_color_FFFFFF_t_70_pic_center]: /images/20221123/ff100a947491414e9a9d9bd7c028e351.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3p5eF9seQ_size_16_color_FFFFFF_t_70_pic_center 1]: /images/20221123/79ad024d96844755913d795f60e82243.png
[Link 1]: https://www.nowcoder.com/discuss/518564
[9.20_Java_2]: https://www.nowcoder.com/discuss/518584
[9_20 Java_AK]: https://www.nowcoder.com/discuss/518602
[2020_9_20]: https://www.nowcoder.com/discuss/518577
[0920]: https://www.nowcoder.com/discuss/518619
[9.20 _Python]: https://www.nowcoder.com/discuss/518630
[9.20_AC]: https://www.nowcoder.com/discuss/518573
[0920_2AC_]: https://www.nowcoder.com/discuss/518607
[9.20]: https://www.nowcoder.com/discuss/518593
[9.20 1]: https://www.nowcoder.com/discuss/518598