自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+

SYSULY的博客

说一声加油一切更美好

  • 博客(17)
  • 收藏
  • 关注

原创 2017年实习笔试面试经验总结

截止到现在为止,自己在大三时找实习的经历也应该算完全结束了。写这篇文章算作是总结,也算是给大家一个小小的经验介绍吧。总的来说,从3月到5月,自己经历了6轮笔试:CVTE,腾讯,网易游戏,金山,微众银行,阿里,7轮面试:腾讯一轮,4399一轮,网易两轮,金山一轮,bigo两轮,在这些笔试面试中,个人技术发挥只能对自己打一个60-70分,在面试过程中,能感觉到自己还很多地方掌握得不好,没有去复习,很多短

2017-05-08 15:45:19 6395

原创 leetcode 138. Copy List with Random Pointer

Description: A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of the list.加上了一个随机指针的链表,随机指针会随机地指向链表

2017-03-31 16:16:31 326

原创 leetcode 109. Convert Sorted List to Binary Search Tree

Description: Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.将链表转化为二叉搜索树,并且要求高度是平衡的Solution: 1、因为要求高度是平衡的,那么我们要找出链表中中间值 2、如何找出中间值,这里同样是利用

2017-03-31 15:51:19 321

原创 leetcode 92. Reverse Linked List II

Description: Reverse a linked list from position m to n. Do it in-place and in one-pass.For example: Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->NULL.Note: Given m, n satisfy th

2017-03-31 15:41:47 262

原创 leetcode 86. Partition List

Description: Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes i

2017-03-30 15:37:22 190

原创 leetcode 83. Remove Duplicates from Sorted List

Description: Given a sorted linked list, delete all duplicates such that each element appear only once.For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3.对于重复的元素,只保留一个,其他保持

2017-03-30 15:24:21 211

原创 leetcode 82. Remove Duplicates from Sorted List II

Description: Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.For example, Given 1->2->3->3->4->4->5, return 1->2->5. Gi

2017-03-30 15:20:32 351

原创 leetcode 61. Rotate List

Description: Given a list, rotate the list to the right by k places, where k is non-negative.For example: Given 1->2->3->4->5->NULL and k = 2, return 4->5->1->2->3->NULL.感觉这题问题描述不是很好,一开始也错了好多次,其实可以理

2017-03-30 15:02:51 223

原创 leetcode 25. Reverse Nodes in k-Group

Description: Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.k is a positive integer and is less than or equal to the length of the linked list. If the

2017-03-30 14:45:30 219

原创 leetcode 24. Swap Nodes in Pairs

Description: Given a linked list, swap every two adjacent nodes and return its head.For example, Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant spa

2017-03-30 14:38:41 174

原创 leetcode 23. Merge k Sorted Lists

Description: Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.归并k个链表排序Solution: 题目类似于上题,但是此题把k不限于为2,这时就不能直接利用归并排序的思想。 因此,此题应该采用堆的思想: 1、将每个非空链表的链头加入最

2017-03-29 22:16:48 182

原创 leetcode 21. Merge Two Sorted Lists

Description: Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.归并排序两个链表Solution: 采用归并排序思想即可,注意防止空指针的出现,在一个链表

2017-03-29 22:05:58 187

原创 leetcode 19. Remove Nth Node From End of List

Description: Given a linked list, remove the nth node from the end of list and return its head.For example,Given linked list: 1->2->3->4->5, and n = 2.After removing the second node from the end, the

2017-03-29 21:56:25 207

原创 leetcode 2. Add Two Numbers

今天刚刷完了leetcode上的链表和树部分,是时候整理一下,就先整理链表吧。description: You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes

2017-03-29 19:45:45 242

原创 python学习笔记

生成器: generator(),与list区别一个是[],一个是() next()函数得到下一个元素或者用for迭代. 函数中有yield,说明不是普通函数,而是generator,执行next()函数时遇到yield就返回,再次执行时从上次遇到yield的地方开始,并且会输出yield后面的值zip函数: 接受任意多个序列作为参数,返回一个tuple. x=1,2,3;y=4,5,6;

2017-03-01 11:56:38 204

原创 利用python爬虫技术获取每天每场的每位球员NBA数据以及每日范特西评分

想法来源:虎扑体育app中有个游戏叫做“每日范特西”,此游戏给于NBA每位球员一个与他能力(数据)相符的身价,玩家的任务是给定金额120,根据每位球员的身价以及位置组建一个自己的阵容(阵容总价不能大于120),之后根据当天每位球员的数据表现,来得出当天的真实评分。每位玩家的任务就是组建一套120以下的阵容,以达到阵容的真实评分最大值。真实评分公式如下: 使用工具:最近接触了python比较多,

2017-03-01 11:52:46 1993

原创 python学习笔记(面向对象)

对象包含了数据和操作数据的函数class Student(继承的类(默认为object)):构造函数初始化:__init__,第一个参数永远是self,表示创建实例本身

2016-07-19 17:58:36 391

空空如也

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除