题目描述：
LeetCode 725. Split Linked List in Parts
Given a (singly) linked list with head node root, write a function to split the linked list into k consecutive linked list "parts".
The length of each part should be as equal ...
归档 2017年11月
[LeetCode]Split Linked List in Parts
[LeetCode]Find Pivot Index
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 724. Find Pivot Index
Given an array of integers nums, write a method that returns the "pivot" index of this array.
We define the pivot index as the index where the sum of the numbers to the left ...
LeetCode Weekly Contest 57解题报告
作者是
发布于
在
LeetCode.
LeetCode Weekly Contest 57是LeetCode举办的第六十一场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-57/
题解列表：
[LeetCode]Candy Crush
作者是
发布于
在
LeetCode.
题目描述：
This question is about implementing a basic elimination algorithm for Candy Crush.
Given a 2D integer array board representing the grid of candy, different positive integers board[i][j] represent different types of candies. A ...
[LeetCode]Remove Comments
作者是
发布于
在
LeetCode.
题目描述：
Given a C++ program, remove comments from it. The program source is an array where source[i] is the i-th line of the source code. This represents the result of splitting the original source ...