CCF 201809-3 元素选择器(80分答案)

题目分析

CCF的第三道题,一般考察的是模拟和文本处理,题目难度不大,但是相当繁琐。按照题目的要求做,需要仔细认真的读题。我使用的是ArrayList解题,看到网上各位大佬使用的方法都是用树作为数据结构,可能这是我代码繁琐和最后出错的原因。

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class Main {



    class HTMLElement
    {
        public String name;
        public String id;
        public int layer;

        public HTMLElement(String name, int layer) {
            this.name = name;
            this.layer = layer;
            this.id = null;
        }
    }


    public HTMLElement getLayers(String string)
    {
        char[] chars = string.toCharArray();
        int pointCount = 0;
        while(chars[pointCount]=='.')
        {
            pointCount++;
        }
        int layer = pointCount/2;
        String name = string.substring(pointCount,chars.length).toLowerCase();
        HTMLElement element = new HTMLElement(name,layer);
        return element;
    }

    public HTMLElement processString(String string)
    {
        String[] strings = string.split(" ");
        HTMLElement element = getLayers(strings[0]);
        if(strings.length==1)
        {
            return element;
        }
        element.id = strings[1];
        return element;
    }

    public ArrayList<Integer> findElements(ArrayList<HTMLElement> elements, String[] strings)
    {
        ArrayList<Integer> results = new ArrayList<Integer>();
        int ruleCounter = 0;
        int layerCounter = 0;
        boolean isStart = true;
        int lastCheckIndex = 0;
        for(int j=0;j<elements.size();j++)
        {
            HTMLElement curElement = elements.get(j);
            String s = curElement.name;
            if(strings[ruleCounter].startsWith("#"))
                s = curElement.id;
            if(s!=null&&isStart&&s.equals(strings[ruleCounter]))
            {
                layerCounter = curElement.layer;
                ruleCounter++;
                isStart = false;
                lastCheckIndex = j;
            }
            else if(!isStart&&curElement.layer<layerCounter)
            {
                ruleCounter = 0;
                isStart = true;
                j = lastCheckIndex;
            }
            else if(s!=null&&s.equals(strings[ruleCounter])&&curElement.layer>layerCounter)
            {
                layerCounter = curElement.layer;
                ruleCounter++;
            }
            if(ruleCounter==strings.length)
            {
                ruleCounter--;
                if(strings.length==1)
                    isStart = true;
                if(!results.contains(j+1))
                    results.add(j+1);
                //j = lastCheckIndex;
            }
        }

        int size = results.size();
        results.add(0,size);
        return results;
    }

    public void run() {
        ArrayList<HTMLElement> elements = new ArrayList<HTMLElement>();
        Scanner in = new Scanner(System.in);
        String num = in.nextLine();
        String[] nums = num.split(" ");
        int htmlLinesNum = Integer.valueOf(nums[0]);
        int searchNum = Integer.valueOf(nums[1]);
        for(int i=0;i<htmlLinesNum;i++)
        {
            try {
                String line = in.nextLine();
                HTMLElement element = processString(line);
                elements.add(element);
            } catch (Exception e) {
                e.printStackTrace();
            }
        }

        for(int i=0;i<searchNum;i++)
        {
            try {
                String line = in.nextLine();
                ArrayList<Integer> integers = findElements(elements, line.split(" "));
                String s = "";
                for(Integer j:integers)
                {
                    s = s + " "+j.toString();
                }
                System.out.println(s);
            } catch (Exception e) {
                e.printStackTrace();
            }
        }

    }

    public static void main(String[] args) {
        Main main = new Main();
        main.run();
    }
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值