INF551 HW2

STATS.PY
import sys,copy,json

jFile=json.load(open(sys.argv[1]))
sumOfHow,sumOfHowMany,sumOfHowMuch,sumOfWhat,sumOfWhen,sumOfWhere,sumOfWhich,sumOfWho,sumOfWhom=0,0,0,0,0,0,0,0,0
# index01=0
# while index01<len(jFile['data']):
#     for answer in jFile['data'][index]['paragraphs'][]
#
#     index01+=1
for cataloge in jFile['data']:
    for contextQas in cataloge['paragraphs']:
        for qas in contextQas['qas']:
            qas['question'].strip()
            if qas['question'].startswith('How many') or qas['question'].startswith('how many'):
                sumOfHowMany+=1
            elif qas['question'].startswith('How much') or qas['question'].startswith('how much'):
                sumOfHowMuch+=1
            elif qas['question'].startswith('How') or qas['question'].startswith('how'):
                sumOfHow+=1
            elif qas['question'].startswith('What') or qas['question'].startswith('what'):
                sumOfWhat+=1
            elif qas['question'].startswith('When') or qas['question'].startswith('when'):
                sumOfWhen+=1
            elif qas['question'].startswith('Where') or qas['question'].startswith('where'):
                sumOfWhere+=1
            elif qas['question'].startswith('Which') or qas['question'].startswith('which'):
                sumOfWhich+=1
            elif qas['question'].startswith('Whom') or qas['question'].startswith('whom'):
                sumOfWhom+=1
            elif qas['question'].startswith('Who') or qas['question'].startswith('who'):
                sumOfWho+=1

output={"how":sumOfHow,"how many":sumOfHowMany,"how much":sumOfHowMuch,"what":sumOfWhat,"when":sumOfWhen,"where":sumOfWhere,"which":sumOfWhich,"who":sumOfWho,"whom":sumOfWhom}

评论

发表评论

此博客中的热门博文

225 Implement Stack using Queues

OA: class MyStack { Queue<Integer> queue; /** Initialize your data structure here. */ public MyStack () { queue = new LinkedList<>(); } /** Push element x onto stack. */ public void push ( int x) { queue.offer(x); int k = queue.size() - 1 ; while (k > 0 ) { queue.offer(queue.poll()); k--; } } /** Removes the element on top of the stack and returns that element. */ public int pop () { return queue.poll(); } /** Get the top element. */ public int top () { return queue.peek(); } /** Returns whether the stack is empty. */ public boolean empty () { return queue.isEmpty(); } } oa是push一次就逆序排一次（相当于每次push一个之后都把新push进去的那个排到最前面，这样下次pop的时候就是pop的这一个。） ma在top和pop的时候才把最后一个调到前面来，而且每次都要重新排。（感觉其实差不多，要看这个这个stack是pop和top用得多还是push用得多） MA: class MyStack { ArrayDeque<Integer> ...
阅读全文

232. Implement Queue using Stacks

MA: class MyQueue {     Stack<Integer> simQ=new Stack<Integer>();     Stack<Integer> buffer=new Stack<Integer>();     /** Initialize your data structure here. */     public MyQueue() {     }         /** Push element x to the back of queue. */     public void push(int x) {         simQ.push(x);     }         /** Removes the element from in front of queue and returns that element. */     public int pop() {         while(!simQ.empty()){             buffer.push(simQ.pop());         }         int temp=buffer.pop();         while(!buffer.empty()){             simQ.push(buffer.pop());         }         return temp;     } ...
阅读全文

20. Valid Parentheses

OA: class Solution { public boolean isValid (String s) { char [] stack = new char [s.length()]; int head = 0 ; for ( char c : s.toCharArray()) { if (c == '(' ) { stack[head++] = c; } else if (c == '[' ) { stack[head++] = c; } else if (c == '{' ) { stack[head++] = c; } else if (c == ')' ) { if (head == 0 ) return false ; if (stack[--head] != '(' ) return false ; } else if (c == ']' ) { if (head == 0 ) return false ; if (stack[--head] != '[' ) return false ; } else if (c == '}' ) { if (head == 0 ) return false ; if (stack[--head] != '{' ) return false ; } } return head == 0 ; } } OA比MA快一倍。 String有个toCharArray()...
阅读全文