算法
许你一个盒
个人博客主页:http://zhenxuexu.github.io
展开
-
Leetcode刷题--Week 1
滚动阅读全文前言眼瞅今年暑假就要开始找工作了,正好借助Leetcode刷题复习一下相关算法,随便为找工作做些准备。接下来每周至少回顾一个算法同时刷一道题,每周打卡。本周刷题树题目:Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortes...原创 2019-03-23 16:25:04 · 201 阅读 · 0 评论 -
Leetcode刷题--Week2
滚动阅读全文前言本周刷了两道LeetCode,穷举和链表排序1、穷举题目:Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.解题思路:遍历所有的点,利用两个构成一条直线,然后在遍历其余的点,判断是否在该直线上,记下在该直线上的所有点的...原创 2019-04-08 21:29:08 · 170 阅读 · 0 评论 -
Leetcode刷题--Week 3
链表插入排序题目Sort a linked list using insertion sort.解题思路一个指针指从原始列表头部开始逐步往后移指向插入元素;一个指针从头遍历已排序链表,找到插入节点,将元素插入:代码 if (head == null || head.next == null){ return head; } ListNode first = new ...原创 2019-04-21 12:14:04 · 192 阅读 · 0 评论 -
Leetcode刷题--Week4
二叉树前序遍历题目Given a binary tree, return the preorder traversal of its nodes’ values.For example:Given binary tree{1,#,2,3},return[1,2,3].Note: Recursive solution is trivial, could you do it iterati...原创 2019-05-05 19:55:52 · 185 阅读 · 0 评论 -
Leetcode刷题--Week 5
前言本周刷题未链表排序相关知识点题目Given a singly linked list L: L 0→L 1→…→L n-1→L n,reorder it to: L 0→L n →L 1→L n-1→L 2→L n-2→…You must do this in-place without altering the nodes’ values.For example,Given{1...原创 2019-06-01 12:47:25 · 236 阅读 · 0 评论