1. 程式人生 > >【LeetCode】93. Restore IP Addresses(C++)

【LeetCode】93. Restore IP Addresses(C++)

地址:https://leetcode.com/problems/restore-ip-addresses/

題目:

Given a string containing only digits, restore it by returning all possible valid IP address combinations.

Example:

Input: “25525511135”
Output: [“255.255.11.135”, “255.255.111.35”]

理解:

要把輸入的字串轉換為所有可能的IP地址

實現:

這種實現非常巧妙
i

jkl表示每段的長度,最小為1,最大為3
要保證加起來長度恰好是s的長度
另外,轉換完之後長度還不能減小,防止出現有0的情況。

class Solution {
public:
	vector<string> restoreIpAddresses(string s) {
		vector<string> res;
		string ans;
		for (int i = 1; i<=3; ++i) 
			for (int j = 1; j<=3; ++j)
				for (int k = 1; k<=3; ++k)
					for (int
l = 1; l <= 3; ++l) { if (i + j + k + l == s.length()) { int tmp1 = stoi(s.substr(0, i)); int tmp2 = stoi(s.substr(i, j)); int tmp3 = stoi(s.substr(i + j, k)); int tmp4 = stoi(s.substr(i + j + k, l)); if (tmp1 <= 255 && tmp2 <= 255 &&
tmp3 <= 255 && tmp4 <= 255) if ((ans = to_string(tmp1) + "." + to_string(tmp2) + "." + to_string(tmp3) + "." + to_string(tmp4)).length() == s.length() + 3) res.push_back(ans); } } return res; } };