提取字符串中的最長(zhǎng)合法簡(jiǎn)單數(shù)學(xué)表達(dá)式，字符串長(zhǎng)度最長(zhǎng)的，并計(jì)算表達(dá)式的值。如果沒(méi)有，則返回0
簡(jiǎn)單數(shù)學(xué)表達(dá)式只能包含以下內(nèi)容
0-9數(shù)字，符號(hào)+-*
說(shuō)明:
1.所有數(shù)字，計(jì)算結(jié)果都不超過(guò)long
2.如果有多個(gè)長(zhǎng)度一樣的，請(qǐng)返回第一個(gè)表達(dá)式的結(jié)果
3.數(shù)學(xué)表達(dá)式，必須是最長(zhǎng)的，合法的
4.操作符不能連續(xù)出現(xiàn)，如+--+1是不合法的

輸入描述:

字符串<

輸出描述:

表達(dá)式值

示例1?輸入輸出示例僅供調(diào)試，后臺(tái)判題數(shù)據(jù)一般不包含示例

輸入

1-2abcd

輸出

-1

Java版本

import java.util.*;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String line = sc.nextLine();
        long res = 0;
        int maxLen = 0;
        int len = line.length();
        for (int i = 0; i < len; i++) {
            if (len - i <= maxLen) {
                break;
            }
            for (int j = i; j < len; j++) {
                String sub = line.substring(i, j + 1);
                Matcher matcher = Pattern.compile("(\\d+)([*+-])(\\d+)").matcher(sub);
                if (matcher.find() && j + 1 - i > maxLen) {
                    maxLen = j + 1 - i;
                    long first = Long.parseLong(matcher.group(1));
                    String op = matcher.group(2);
                    long second = Long.parseLong(matcher.group(3));
                    switch (op) {
                        case "+":
                            res = first + second;
                            break;
                        case "-":
                            res = first - second;
                            break;
                        case "*":
                            res = first * second;
                            break;
                    }
                }
            }
        }
        System.out.println(res);
    }
}

Python版本

import re

line = input()
res = 0
max_len = 0
length = len(line)

for i in range(length):
    if length - i <= max_len:
        break
    for j in range(i, length):
        sub = line[i:j+1]
        match = re.search(r'(\d+)([*+-])(\d+)', sub)
        if match and j + 1 - i > max_len:
            max_len = j + 1 - i
            first = int(match.group(1))
            op = match.group(2)
            second = int(match.group(3))
            if op == '+':
                res = first + second
            elif op == '-':
                res = first - second
            elif op == '*':
                res = first * second

print(res)

C++版本

#include <iostream>
#include <string>
#include <regex>
using namespace std;

int main() {
    string line;
    getline(cin, line);
    long long res = 0;
    int maxLen = 0;
    int len = line.length();
    for (int i = 0; i < len; i++) {
        if (len - i <= maxLen) {
            break;
        }
        for (int j = i; j < len; j++) {
            string sub = line.substr(i, j - i + 1);
            smatch match;
            regex pattern("(\\d+)([*+-])(\\d+)");
            if (regex_search(sub, match, pattern) && j + 1 - i > maxLen) {
                maxLen = j + 1 - i;
                long long first = stoll(match[1]);
                string op = match[2];
                long long second = stoll(match[3]);
                if (op == "+") {
                    res = first + second;
                } else if (op == "-") {
                    res = first - second;
                } else if (op == "*") {
                    res = first * second;
                }
            }
        }
    }
    cout << res << endl;
    return 0;
}

C語(yǔ)言版本

#include <stdio.h>
#include <string.h>
#include <stdbool.h>

bool isOperator(char c) {
    return c == '+' || c == '-' || c == '*';
}

long long calculate(long long first, char op, long long second) {
    if (op == '+') {
        return first + second;
    } else if (op == '-') {
        return first - second;
    } else if (op == '*') {
        return first * second;
    }
    return 0;
}

int main() {
    char line[100];
    fgets(line, sizeof(line), stdin);

    long long res = 0;
    int maxLen = 0;
    int len = strlen(line);
    for (int i = 0; i < len; i++) {
        if (len - i <= maxLen) {
            break;
        }
        for (int j = i; j < len; j++) {
            char sub[100];
            strncpy(sub, &line[i], j - i + 1);
            sub[j - i + 1] = '\0';

            long long first, second;
            char op;
            int matched = sscanf(sub, "%lld%c%lld", &first, &op, &second);
            if (matched == 3 && isOperator(op) && j + 1 - i > maxLen) {
                maxLen = j + 1 - i;
                res = calculate(first, op, second);
            }
        }
    }

    printf("%lld\n", res);
    return 0;
}

Node.js版本文章來(lái)源地址http://www.zghlxwxcb.cn/news/detail-850086.html

const readline = require('readline');

const rl = readline.createInterface({
    input: process.stdin,
    output: process.stdout
});

function isOperator(c) {
    return c === '+' || c === '-' || c === '*';
}

function calculate(first, op, second) {
    if (op === '+') {
        return first + second;
    } else if (op === '-') {
        return first - second;
    } else if (op === '*') {
        return first * second;
    }
    return 0;
}

rl.question('Enter a line: ', (line) => {
    let res = 0;
    let maxLen = 0;
    const len = line.length;

    for (let i = 0; i < len; i++) {
        if (len - i <= maxLen) {
            break;
        }
        for (let j = i; j < len; j++) {
            const sub = line.substring(i, j + 1);
            const match = sub.match(/(\d+)([*+-])(\d+)/);
            if (match && j + 1 - i > maxLen) {
                maxLen = j + 1 - i;
                const first = parseInt(match[1]);
                const op = match[2];
                const second = parseInt(match[3]);
                res = calculate(first, op, second);
            }
        }
    }

    console.log(res);
    rl.close();
});

到了這里，關(guān)于提取字符串中的最長(zhǎng)數(shù)學(xué)表達(dá)式并計(jì)算（67%用例） C卷(Java&&Python&&C++&&Node.js&&C語(yǔ)言)的文章就介紹完了。如果您還想了解更多內(nèi)容，請(qǐng)?jiān)谟疑辖撬阉鱐OY模板網(wǎng)以前的文章或繼續(xù)瀏覽下面的相關(guān)文章，希望大家以后多多支持TOY模板網(wǎng)！