- 博客(7)
- 收藏
- 关注
RSS订阅原创 LeetCode124. Binary Tree Maximum Path Sum
有关于leetcode的刷题记录。这次是124题。首先看题干：···Given anon-emptybinary tree, find the maximum path sum.For this problem, a path is defined as any sequence of nodes from some starting node to any node in th...
2020-04-15 12:07:21
127
原创 关于Mac OS下的pip：Operation not permitted问题
关于Mac下的pip：Operation not permmited问题Mac OS 有一个非常讨厌的问题，就是权限问题这个问题绝对让人恶心，因为权限好巧不巧是你电脑的最后防线，你想说理都没地方说去。然而Google大法好，要安装库可以这么写：sudo pip install 安装库的名称（例如jieba）--upgrade --ignore-installed 可以直接避免所有问题。
2017-05-26 18:54:20
2587
原创 LeetCode #57 | Insert Interval
首先是题目：Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted according to their start
2017-04-24 18:21:11
218
原创 LeetCode OJ | #25 Reverse Nodes in k-Group
考试前刷一波leetcode。这次的问题依然是简单的，但是处理方式极为麻烦，因为涉及到了单向链表的反转操作。C++有个规律：一旦涉及到指针和链表的东西，绝对会有无数的边界情况和细节在等着你。先上题：Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If
2016-06-21 11:34:50
318
原创 LeetCode OJ | #315 Count of Smaller Numbers After Self
You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller elements to the right of nums[i].Example:Given
2016-05-06 18:07:21
305
原创 Leetcode OJ | Number of Digit One
先上题： Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.For example: Given n = 13, Return 6, because digit 1 occurred in the followi
2016-05-04 23:47:42
344
原创 LeetCode OJ | Search a 2D Matrix
LeetCode的这个问题可用“夹逼”的思想完成。 题目如下 Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted in ascending from le
2016-04-26 20:57:40
370
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人