給予一個整數(shù)字符串，找出所有連續(xù)子串和的最大值。
樣例輸入：-23 17 -7 11 -2 1 -34
樣例輸出：21

JavaScript(Node)實現(xiàn)

const readline = require('readline');
const rl = readline.createInterface({
    input: process.stdin,
    output: process.stdout
});
rl.on('line', function(line) {
    let str = line;
    let res = findMaxSum(str);
    console.log(res);
});

function findMaxSum(str) {
    let arr = str.split(' ').map(val => +val);
    let len = arr.length;
    let sum = Number.MIN_SAFE_INTEGER;
    let temp;
    for (let i = 0; i < len; i++) {
        temp = 0;
        for (let j = i; j < len; j++) {
            temp += arr[j];
            if (temp > sum) {
                sum = temp;
            }
        }
    }
    return sum;
}

PHP實現(xiàn)

<?php
    $handle = fopen("php://stdin", "r");
    $str = fgets($handle);
    while ($str !== "") {
        echo findMaxSum($str) . "\n";
        $str = fgets($handle);
    }
    fclose($handle);

    function findMaxSum($str) {
        $arr = array_map("intval", explode(" ", $str));
        $len = count($arr);
        $sum = PHP_INT_MIN;
        for ($i = 0; $i < $len; $i++) {
            $temp = 0;
            for ($j = $i; $j < $len; $j++) {
                $temp += $arr[$j];
                if ($temp > $sum) {
                    $sum = $temp;
                }
            }
        }
        return $sum;
    }

C++實現(xiàn)

#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <limits>
using namespace std;

int findMaxSum(string s) {
    stringstream iss(s);
    int number;
    vector<int> v;
    while(iss >> number) {
        v.push_back(number);
    }
    int n = v.size();
    int sum = numeric_limits<int>::min();
    int temp;
    for (int i = 0; i < n; i++) {
        temp = 0;
        for (int j = i; j < n; j++) {
            temp += v[j];
            if (temp > sum) {
                sum = temp;
            }
        }
    }
    return sum;
}

int main() {
    string s;
    while (getline(cin, s)) {
        cout << findMaxSum(s) << endl;
    }
    return 0;
}

題目比較簡單，主要是熟悉一下各種語言的寫法。

以上。

個人技術(shù)博客 biebu.xin，原文鏈接——多語言解編程題之最大子串和