标签归档：leetcode

题目描述：

LeetCode 693. Binary Number with Alternating Bits

Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values.

Example 1:

Input: 5
Output: True
Explanation:
The binary representation of 5 ...

LeetCode Weekly Contest 52是LeetCode举办的第五十六场正式周赛，共4道题目，比赛时长1.5小时。

比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-52/

题解列表：

LeetCode 686. Repeated String Match

LeetCode 687. Longest Univalue Path

LeetCode 688. Knight Probability in Chessboard

LeetCode 689. Maximum Sum of 3 Non-Overlapping Subarrays

题目描述：

LeetCode 689. Maximum Sum of 3 Non-Overlapping Subarrays

In a given array nums of positive integers, find three non-overlapping subarrays with maximum sum.

Each subarray will be of size k, and we want to maximize the sum of all ...

题目描述：

LeetCode 688. Knight Probability in Chessboard

On an NxN chessboard, a knight starts at the r-th row and c-th column and attempts to make exactly K moves. The rows and columns are 0 indexed, so ...

题目描述：

LeetCode 687. Longest Univalue Path

Given a binary tree, find the length of the longest path where each node in the path has the same value. This path may or may not pass through the root.

Note: The length ...