Smarking Algorithm Contest是LeetCode举办的第九场正式周赛，共4道题目，比赛时长2.5小时。
比赛链接：https://leetcode.com/contest/smarking-algorithm-contest/
题解列表：
LeetCode 438. Find All Anagrams in a String
标签归档：leetcode
[LeetCode]Smarking Algorithm Contest解题报告
[LeetCode]K-th Smallest in Lexicographical Order
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 440. K-th Smallest in Lexicographical Order
Given integers n and k, find the lexicographically k-th smallest integer in the range from 1 to n.
Note: 1 ≤ k ≤ n ≤ 109.
Example:
Input: n: 13 k ...
[LeetCode]Ternary Expression Parser
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 439. Ternary Expression Parser
Given a string representing arbitrarily nested ternary expressions, calculate the result of the expression. You can always assume that the given expression is valid and only consists of digits 0-9, ?, :, T and F (T ...
[LeetCode]Find All Anagrams in a String
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 438. Find All Anagrams in a String
Given a string s and a non-empty string p, find all the start indices of p's anagrams in s.
Strings consists of lowercase English letters only and the length of ...
[LeetCode]Path Sum III
作者是
发布于
在
LeetCode.
题目描述：
You are given a binary tree in which each node contains an integer value.
Find the number of paths that sum to a given value.
The path does not need to start or end ...