找出数组中第一次连续出现的数的索引

会找出第一次出现的连续数的索引

/**
 * 业精于勤荒于嬉 行成于思毁于随
 * <p>
 * Created by wuzhuang on  2018年06月8日 20:01.
 * QQ:1412016469
 * email:wzstart@126.com
 * <p>
 * 高山仰止，景行行止，虽不能至，心向往之
 */
  @Test
    public void test2() {
        int[] signals = new int[]{0, 0, 0, 0, 0, 0, 1, 1,1,1,0}; 
        int startIndex = -2;
        boolean isFirst = true;
        //
        ArrayList<Integer> index = new ArrayList<>();
        for (int i = 0; i < signals.length; i++) {
            if (signals[i] == 1) {
                if (i - startIndex == 1) {
                    startIndex = i;
                    index.add(i);
                }
                if (isFirst) {
                    startIndex = i;
                    index.add(i);
                    isFirst = false;
                }
            }
        }
        System.out.println(index);
    }

返回 [6, 7, 8, 9]

    /**
    * 从url中获取所有请求的参数
    */
    @Test
    public void test3(){
        Map<String, Object> requestParamMap = new HashMap<>();

        String url = queryParam.getUrl();

        if (StringUtils.isNotBlank(url)) {
            url = url.trim(); //localhost:8301/opera/uriRuleMatch?name=zhangsan&age=17&address=sdhz&length=18m
            if (url.indexOf("?") != -1) {
                url = url.substring(url.indexOf("?") + 1);//name=zhangsan&age=17&address=sdhz&length=18m
                String[] kv = url.split("&");
                for (int i = 0; i < kv.length; i++) {//name=zhangsan
                    String[] split = kv[i].split("=");
                    requestParamMap.put(split[0], split[1]);
                }
            }
        }
    }