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