题36 网络路径和 about kamacoder-solutions HOT 3 OPEN

std::vector<std::vector<int>> str2vec(const std::string& str) {
  std::vector<std::string> rows;

  auto start = str.find("[", 1);
  auto end = str.find("]");

  while (start != std::string::npos) {
    rows.emplace_back(str.substr(start + 1, end - start - 1));
    start = str.find("[", end + 1);
    end = str.find("]", end + 1);
  }

  int r = rows.size();
  int c = std::count(rows[0].begin(), rows[0].end(), ',') + 1;
  std::vector<std::vector<int>> nums(r, std::vector<int>(c, 0));
  for (int i = 0; i < r; ++i) {
    std::stringstream ss(rows[i]);
    std::string elem;
    int j = 0;
    while (getline(ss, elem, ',')) {
      nums[i][j++] = std::stoi(elem);
    }
  }

  return nums;
}