题目描述：
LeetCode 567. Permutation in String
Given two strings s1 and s2, write a function to return true if s2 contains the permutation of s1. In other words, one of the first string's permutations is the substring of the second ...
归档 2017
[LeetCode]Permutation in String
[LeetCode]Subarray Sum Equals K
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 560. Subarray Sum Equals K
Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k.
Example 1:
Input:nums = [1,1,1], k = 2 ...
[LeetCode]Reshape the Matrix
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 566. Reshape the Matrix
In MATLAB, there is a very useful function called 'reshape', which can reshape a matrix into a new one with different size but keep its original data.
You're given a matrix represented by a ...
LeetCode Weekly Contest 29解题报告
作者是
发布于
在
LeetCode.
LeetCode Weekly Contest 29是LeetCode举办的第三十四场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-29/
题解列表：
LeetCode 563. Binary Tree Tilt
LeetCode 561. Array Partition I
[LeetCode]Find the Closest Palindrome
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 564. Find the Closest Palindrome
Given an integer n, find the closest integer (not including itself), which is a palindrome.
The 'closest' is defined as absolute difference minimized between two integers.
Example 1:
Input: "123" Output: "121"
Note ...