扬仔的杂货铺

import org.springframework.cloud.gateway.filter.GatewayFilterChain;
import org.springframework.cloud.gateway.filter.GlobalFilter;
import org.springframework.cloud.gateway.filter.NettyWriteResponseFilter;
import org.springframework.core.Ordered;
import org.springframework.http.HttpHeaders;
import org.springframework.stereotype.Component;
import org.springframework.web.server.ServerWebExchange;
import reactor.core.publisher.Mono;
import java.util.ArrayList;


@Component("corsResponseHeaderFilter")
public class CorsResponseHeaderFilter implements GlobalFilter, Ordered {

    @Override
    public Mono<Void> filter(ServerWebExchange exchange, GatewayFilterChain chain) {
        return chain.filter(exchange).then(Mono.defer(() -> {
            exchange.getResponse().getHeaders().entrySet().stream()
                    .filter(kv -> (kv.getValue() != null && kv.getValue().size() > 1))
                    .filter(kv -> (kv.getKey().equals(HttpHeaders.ACCESS_CONTROL_ALLOW_ORIGIN)
                            || kv.getKey().equals(HttpHeaders.ACCESS_CONTROL_ALLOW_CREDENTIALS)))
                    .forEach(kv -> {
                        kv.setValue(new ArrayList<String>() {{
                            add(kv.getValue().get(0));
                        }});
                    });

            return chain.filter(exchange);
        }));
    }

    @Override
    public int getOrder() {
        // 指定此过滤器位于NettyWriteResponseFilter之后
        // 即待处理完响应体后接着处理响应头
        return NettyWriteResponseFilter.WRITE_RESPONSE_FILTER_ORDER + 1;
    }
}

class Solution {
    public int maxLengthBetweenEqualCharacters(String s) {
        // 最后结果保存
        int result = -1;
        // 字符串转换成char类型数组
        char[] chars = s.toCharArray();
        for (int i = 0; i < chars.length; i++) {
            // 如果结果已经大于数组的剩余长度，直接返回（就算有解肯定也不能大于result）
            if (result > chars.length - i - 1){
                break;
            }
            // 从后向前查找i开始剩下的字符串是否有相同字符
            int i1 = s.substring(i).lastIndexOf(chars[i]) + i;
            // 如果找到，计算之间的长度
            if (i1 > 0){
                int temp = i1 - i - 1;
                if (temp > result){
                    result = temp;
                }
            }
        }
        return result;
    }
}