PYTHON

lala = [1,1,1,2,3,4,5,8,10,22,24,25,26,66]
res = []
tmp = [lala[0]]
for i in range(1, lala.__len__()):
    if lala[i] - lala[i-1] == 1:
        tmp.append(lala[i])
    else:
        if len(tmp) == 1:
            res.append(tmp[0])
            tmp = [lala[i]]
        else:
            res.append(tmp)
            tmp = [lala[i]]

print(res)

php版本:

<?php

$arr = [1,1,1,2,3,4,5,8,10,22,24,25,26,66];

function sorted_arr($arr) {
    $new_arr = [];
    $sorted_arr= [];
    foreach ($arr as $index => $number) {
        if ((isset($arr[$index + 1]) && $number + 1 == $arr[$index + 1]) || (isset($arr[$index - 1]) && $arr[$index - 1] + 1 == $number)) {
            array_push($sorted_arr, $number);
        } else if (!empty($sorted_arr)){
            array_push($new_arr, $sorted_arr);
            $sorted_arr = [];
        } else {
            array_push($new_arr, $number);
        }    
    }
    return $new_arr; 
}


?>

php版，菜鳥(niǎo)的想法:

`<?php 
 $arr = [1,1,1,2,3,4,5,8,10,22,24,25,26,66];
 $new_arr = '';
 foreach($arr as $k => $v){
    if($k == 0){
        $new_arr .= $v;
    }else{
        if($arr[$k-1]+1 == $v){
            $new_arr .= ",".$v;
        }else{
            $new_arr .= "#".$v;
        }
    }
 }
 $new_arr_1 = explode("#",$new_arr);
 foreach($new_arr_1 as $k1 => $v1){
    if(strpos($v1,",") !== false){
        $new_arr_2 = explode(",",$v1);
        $new_arr_1[$k1] = $new_arr_2;
    }
 }
 print_r($new_arr_1);
?>`

python

a = [1, 1, 1, 2, 3, 4, 5, 8, 10, 22, 24, 25, 26, 66]
b = []
i = 1
while (i < len(a)):
    if a[i] - a[i - 1] == 1:
        b.append([a[i - 1]])
        for j in range(i, len(a)):
            if a[j] - a[j - 1] == 1:
                b[-1].append(a[j])
            else:
                i = j
                break
    else:
        b.append(a[i])
        i += 1

print(a)
print(b)

我看有個(gè)python的答案預(yù)先把a(bǔ)[0]放進(jìn)去了，這是不合法的，因?yàn)槟悴恢廊绾闻袛嗟谝粋€(gè)是哪個(gè)

太厲害了！有個(gè)兄弟發(fā)現(xiàn)我的問(wèn)題了，改進(jìn)之后的代碼如下：

a = [1, 1, 1, 2, 3, 4, 5, 8, 10, 22, 24, 25, 26, 66, 67, 67]
b = []
i = 1
while (i < len(a)):
    if a[i] - a[i - 1] == 1:
        b.append([])
        for j in range(i, len(a)):
            i += 1
            if a[j] - a[j - 1] == 1:
                b[-1].append(a[j - 1])
                print(i)
                if j == len(a) - 1:
                    b[-1].append(a[j])
                    break
            else:
                b[-1].append(a[j - 1])
                if j == len(a) - 1:
                    b.append(a[j])
                break
    else:
        b.append(a[i - 1])
        i += 1

print(a)
print(b)

由于我沒(méi)有潔癖就不優(yōu)化代碼了，畢竟添加的一個(gè)判斷不會(huì)影響時(shí)間復(fù)雜度。

一行python版本：

from itertools import groupby

arr = [1,1,1,2,3,4,5,8,10,22,24,25,26,66]

print([j[0] if len(j) == 1 else j for j in [[i[1] for i in g] for k, g in groupby(enumerate(arr), lambda x: x[1] - x[0])]])

效率和可讀性就忽略好了。

那就補(bǔ)個(gè)樸素易懂的吧：

arr = [1,1,1,2,3,4,5,8,10,22,24,25,26,66]
tmp = [arr[0]]
res = []
length = len(arr)
for i in range(1, length):
    if arr[i] - arr[i-1] == 1:
        tmp.append(arr[i])
    else:     
        res.append(tmp[0] if len(tmp) == 1 else tmp)
        tmp = [arr[i]]
res.append(tmp[0] if len(tmp) == 1 else tmp)

兩個(gè)指針 i,j

var arr = [1,1,1,2,3,4,5,8,10,22,24,25,26,66]
var len = arr.length
var i = 1, j = 0
var rst = []
for(; i <= len; i++) {
  if(arr[i]-arr[i-1] !== 1) {
    i-j===1 ? rst.push(arr[j]) : rst.push(arr.slice(j, i))
    j = i
  }
}

兩個(gè)指針不就可以了嗎。
注意點(diǎn)就是合并以后后面的指針要減去長(zhǎng)度。

function mergeSeq(array) {
    let result = [];
    let arr = [];

    for (let i = 0; i < array.length; i++) {
        let element = array[i];
        arr[0] = element;
        console.log(i);
        for (let j = i + 1; j < array.length; j++) {
            const e = array[j];
            if ((e - element) == 1) {
                arr.push(e);
                element = e;
            } else {
                break;
            }
            i++;
            console.log(i);
        }
        if (arr.length == 1) {
            result.push(arr[0]);
        } else {
            result.push(arr);
        }
        arr = [];
    }
    return result;
}
let array = [
    1,
    1,
    1,
    2,
    3,
    4,
    5,
    8,
    10,
    22,
    24,
    25,
    26,
    66
];
console.log(array.length);
let result = mergeSeq(array);
console.log(result);

快速寫(xiě)了下，沒(méi)有測(cè)試邊界

折騰了一下，php版本

$arr = [1,1,1,2,3,4,5,8,10,22,24,25,26,66];
$len = count($arr);
sort($arr, SORT_ASC);
$res   = [];
$index = 0;
for ($i = 0; $i < $len - 1; $i++) {
    if ($arr[$i+1] == $arr[$i] + 1) {
        $res[$index][] =  $arr[$i];
        if ($arr[$i+1] + 1 != $arr[$i+2]) {
            $res[$index][] =  $arr[$i+1];
            $i++;
            $index++;
            $res[$index] = $arr[$i+1];
        }
    } else {
        $res[$index] = $arr[$i];
        $index++;
    }
}
echo json_encode($res);

既然在Go版塊看到，那就來(lái)個(gè)Go版本的吧：

func resort(arr []int) interface{} {
    if len(arr) == 1 {
        return arr
    }
    i, j := 1, 0
    subArr := []interface{}{}
    for ; i < len(arr); i++ {
        if arr[i] != arr[i - 1] + 1 {
            if j == i - 1 {
                subArr = append(subArr, arr[i - 1])
            } else {
                subArr = append(subArr, arr[j:i])
            }
            j = i
        }
    }
    return subArr
}

來(lái)個(gè)C++的吧，C++不能把int和array同時(shí)放到一個(gè)array里，所以要用2D arrray

vector<vector<int>> groupNum(vector<int>& nums) { 
    sort(nums.begin(), nums.end()); // in case nums is not in order
    vector<vector<int>> res;
    for(int i : nums) {
        if (res.empty() || res.back().back() != i - 1)
            res.push_back(vector<int>({i}));
        else
            res.back().push_back(i);
    }   
    return res;
}