g0901_1000.s0918_maximum_sum_circular_subarray

Class Solution

java.lang.Object

g0901_1000.s0918_maximum_sum_circular_subarray.Solution

public class Solution
extends Object

917 - Reverse Only Letters.

Easy

Given a string s, reverse the string according to the following rules:

• All the characters that are not English letters remain in the same position.
• All the English letters (lowercase or uppercase) should be reversed.

Return s after reversing it.

Example 1:

Input: s = “ab-cd”

Output: “dc-ba”

Example 2:

Input: s = “a-bC-dEf-ghIj”

Output: “j-Ih-gfE-dCba”

Example 3:

Input: s = “Test1ng-Leet=code-Q!”

Output: “Qedo1ct-eeLg=ntse-T!”

Constraints:

• 1 <= s.length <= 100
• s consists of characters with ASCII values in the range [33, 122].
• s does not contain '\"' or '\\'.

Constructor Summary

Constructors

Constructor and Description
Solution()

Method Summary

Modifier and Type	Method and Description
int	maxSubarraySumCircular(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Solution

public Solution()

Method Detail

maxSubarraySumCircular

public int maxSubarraySumCircular(int[] nums)