第1天：网易2018年校园招聘NLP算法工程师笔试试卷分析

import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int maxLen = 0;
        int m = s.nextInt();
        int n = s.nextInt();
        int[] parent = new int[50];
        int[] depth = new int[100];
        for(int i = 1;i < m;i++) {
            parent[i] = s.nextInt();
            depth[i] = depth[parent[i]] + 1;
            if(depth[i] > maxLen) {
                maxLen = depth[i];
            }   
        }
        int count = 0;
        if(maxLen > n) {
            count = n;
        }else {
            count = (n - maxLen)/2 + maxLen;
        }
        System.out.println(count + 1);
        s.close();
    }
}

N, L = map(int, input().split())
parents = [int(i) for i in input().split()]
nodes_depth = [0] * N
for i in range(N-2):
    nodes_depth[i+1] = nodes_depth[parents[i]] + 1
max_depth = max(nodes_depth)
if L <= max_depth:
    max_cities = L + 1
else:
    max_cities = max_depth + ((L - max_depth) // 2) + 1
if max_cities <= N:
    print(max_cities)
else:
    print(N)

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        while(sc.hasNext()){
            int n = sc.nextInt();
            int two = 0; 
            int four = 0; 
            for(int i=0; i<n; i++){
                int a = sc.nextInt();
                if(a%4 == 0)
                    four++;
                else if(a%2 == 0)
                    two++;
            }
            if(four >= n-four-two) 
               System.out.println("Yes");
            else
                System.out.println("No");
        }
        sc.close();
    }
}

t = int(input())
ns = []
arrays = []
for each in range(t):
    ns.append(int(input()))
    arrays.append([i for i in map(int, input().split())])
count = 0
results = []
while count < t:
    n = ns[count]
    array = arrays[count]
    fours = 0
    twos = 0
    others = 0
    for each in array:
        if each % 4 == 0:
            fours += 1
        elif each % 2 == 0:
            twos += 1
        else:
            others += 1
    if twos == 0:
        if fours >= n // 2:
            results.append('Yes')
        else:
            results.append('No')
    else:
        if fours >= others:
            results.append('Yes')
        else:
            results.append('No')
    count += 1
for each in results:
    print(each)

import java.util.Scanner;
public class Main {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] x = new int[n];
        int[] y = new int[n];
        for(int i=0;i < n;i++){
            x[i] = sc.nextInt();
        }
        for(int i=0;i < n;i++){
            y[i] = sc.nextInt();
        }
        int[] slope = new int[n*n];
        int[] verticalSlope = new int[n*n];
        int s=0;
        for(int j=0;j < n;j++){
            for(int k=j+1; k < n;k++){
                if(x[j]-x[k] != 0 && y[j]-y[k] != 0){
                    slope[s] = (x[j]-x[k])/(y[j]-y[k]);
                    if(slope[s] != 0){
                        verticalSlope[s] = -1*(1/slope[s]);
                        s++;
                    }
 
                }
 
            }
        }
        int b1 = 0;
        int b2 = 0;
        int counth = 0;
        int countv = 0;
        int intersection = 0;
        int temp1=0;
        int temp2=0;
        for(int u=0;u<s;u++){
            for(int i=0;i<n;i++){
                b1 = slope[u]*x[i]-y[i];
                for(int j=0;j<n;j++){
                    b2 = verticalSlope[u]*x[j]-y[j];
                    for(int k=0;k<n;k++){
                        if(y[k] == slope[u]*x[k]-b1){
                            counth++;
                        }
                        if(y[k] == verticalSlope[u]*x[k]-b2){
                            countv++;
                        }
                        if(y[k] == slope[u]*x[k]-b1 && y[k] == verticalSlope[u]*x[k]-b2){
                            intersection++;
                        }
                    }
                    temp1 = counth+countv-intersection;
                    counth = 0;
                    countv = 0;
                    intersection = 0;
                    if(temp1 > temp2){
                        temp2 = temp1;
                    }
                }
            }
        }
        int xValue = 0;
        int yValue = 0;
        int counth2 = 0;
        int countv2 = 0;
        int intersection2 = 0;
        int temp3 = 0;
        int temp4 = 0;
        for(int u=0;u<n;u++){
            for(int i=0;i<n;i++){
                xValue = x[u];
                yValue = y[i];
                for(int j=0;j<n;j++){
                    if(x[j] == xValue){
                        counth2++;
                    }
                    if(y[j] == yValue){
                        countv2++;
                    }
                    if(x[j] == xValue && y[j] == yValue){
                        intersection2++;
                    }
                }
                temp3 = counth2+countv2-intersection2;
                counth2 = 0;
                countv2 = 0;
                intersection2 = 0;
                if(temp3 > temp4){
                    temp4 = temp3;
                }
            }
        }
        if(temp4 > temp2){
            temp2 = temp4;
        }
        System.out.println(temp2);
    }
}

n = int(input())
x,y = list(map(int, input().split())),list(map(int, input().split()))
max_n = 0
if n < 4:
    max_n = n
for i in range(n-3):
    for j in range(i+1,n-2):
        if i != j:
            X1 = x[j] - x[i]
            Y1 = y[j] - y[i]
            for k in range(i+2,n-1):
                if (k != i)and(k != j):
                    count = 3
                    for l in range(i+3,n):
                        if (l != i)and(l != j)and(l != k):
                            X2 = x[l] - x[k]
                            Y2 = y[l] - y[k]
                            X3 = x[l] - x[i]
                            Y3 = y[l] - y[i]
                            if (X1*X2+Y1*Y2==0) or (X1*Y3==X3*Y1):
                                count += 1
                    if (count > max_n):
                        max_n = count
print (max_n)

项目名称：关键词搜索系统的实现
项目目标：用NLP中的NLTK语料库对关键词进行搜索
用到的架构：前端是用node.js下的Vue以及HTML为主作为开发，后端是利用流行的SSM框架作为后端的。并且利用redis作为数据的缓存。
负责的模块：对预料库中的关键词进行提取，通过建立模型来达到其准确率。本人在主题词提取中用到了Word2vec以及LDA，并且用到了LSTM对其关键词的模型进行训练。其准确率高达99.5%。在这个项目中，用RNN中的LSTM算法，使其独有的双循环门得到了充分的利用，并且激活函数用到了BRELU，用adam作为优化器，用mse作为损失函数。
主要的困难：在建模的时候，测试集上的效果比较差，只能达到85.23%，可是在训练集竟然能到达到99.36%，也就是我们常见的过拟合问题。最后的效果提升的很明显。