2020哔哩哔哩校招后端开发笔试编程题总结

package Day44;
/**
 * @Author Zhongger
 * @Description 给定一个正整数N，试求有多少组连续正整数满足所有数字之和为N? (1 <= N <= 10 ^ 9)
 * @Date 2020.3.17
 */
public class FindSumIsNSolution {
    public static void main(String[] args) {
        System.out.println(new FindSumIsNSolution().getSum(100));
    }
    public int getSum(int n){
        if (n<1||n>Math.pow(10,9)){
            return 0;
        }
        int count=0;
        for (int i = 1; i < n/2+1; i++) {
            int curSum=0;
            int curVal=i;
            while (curSum<n){
                curSum+=curVal;
                curVal++;
            }
            if (curSum==n){
                count++;
            }
        }
        return count;
    }
}

package Day44;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Scanner;
/**
 * @Author Zhongger
 * @Description 从标准输入读取字符串，按照指定的两层分隔符切分成多对key-value，依次输出到标准输出中。
 * 注意：仅输出key和value都为非空串的pair。
 * @Date 2020.3.17
 */
public class SplitStringToKVSolution {
    public static void main(String[] args) {
        SplitStringToKVSolution splitStringToKVSolution = new SplitStringToKVSolution();
        String string = splitStringToKVSolution.getString();
        splitStringToKVSolution.printKeyValue(string);
    }
    public String getString(){
        Scanner scanner = new Scanner(System.in);
        return scanner.nextLine();
    }
    public void printKeyValue(String str){
        String[] strings = str.split(" ");//以' '为分隔符
        String key_value_pairs_delimiter = strings[0]; //每个k-v对之间的分隔符
        String key_value_delimiter = strings[1];//k与v的分隔符
        String kvStr=strings[2];//待处理的串
        String[] eachKVStrs = kvStr.split(key_value_pairs_delimiter);//键值对数组，其中每个元素为键值对
        int count=0;//有效键值对的个数
        HashMap<String, String> map = new HashMap<>();//存放键值对
        for (String eachKVStr : eachKVStrs) {//遍历拿到每个键值对
            String[] kvs = eachKVStr.split(key_value_delimiter);//拿到键、值数组
            if (kvs.length==2){//有效的键值对
                count++;
                map.put(kvs[0],kvs[1]);
            }
        }
        System.out.println(count);
        Iterator<Map.Entry<String, String>> iterator = map.entrySet().iterator();
        while (iterator.hasNext()){
            Map.Entry<String, String> entry = iterator.next();
            System.out.println(entry.getKey()+" "+entry.getValue());
        }
    }
}