来源：投稿 作者：LSC
编辑：学姐
1. 自我介绍
2. 介绍自己的项目
3. 编程题
判断一个链表是不是会文链表class ListNode:
def __init__(self, val, next=None):self.val = valself.next = nextdef reverse(head):pre = Nonep = headwhile p != None:t = p.nextp.next = prepre = pp = treturn predef is_huiwen(head):if head == None or head.next == None:return 1pre = ListNode(0)pre.next = headslow, fast = pre, prewhile fast.next != None:slow = slow.nextfast = fast.nextif fast.next != None:fast = fast.nextq = slow.nextslow.next = Nonep1 = reverse(q)p2 = headwhile p1 != None:if p1.val != p2.val:return 0p1 = p1.nextreturn 1a = [1, 2, 1, 2, 1]
head = ListNode(a[0])
dummy = head
for i in a[1:]:node = ListNode(i)dummy.next = nodedummy = node
print(is_huiwen(head))
4. 自注意力机制
5. BN和LN的区别
6. 反问
实习要半年才能转正
业务(主要是大数据和用户画像的构建，模型方面偏向推荐和NLP)
关注下方《学姐带你玩AI》🚀🚀🚀
算法工程师万能简历公式+200多个简历模板（中英文）
回复“简历”轻松获取！
码字不易，欢迎大家点赞评论收藏！
