UVaOJ 1593 – Alignment of Code

问题描述

解法一：模拟

字符串模拟处理的水题，用 stringstream 进行处理会很方便，注意行末不需要补充空格；

#include <bits/stdc++.h>

using namespace std;

int main() {
  string line, word;
  vector<int> max_len(200, 0);
  vector<vector<string>> lines;

  while (getline(cin, line)) {
    stringstream ss(line);
    vector<string> line_words;
    int column_idx = 0;
    while (ss >> word) {
      line_words.push_back(word);
      max_len[column_idx] =
          max(max_len[column_idx], static_cast<int>(word.length()));
      column_idx += 1;
    }
    lines.push_back(line_words);
  }
  for (auto& line : lines) {
    for (int i = 0; i < line.size(); ++i)
      cout << line[i] << (i == line.size() - 1 ? ""  // note this case
           : string(max_len[i] - line[i].length() + 1, ' '));
    cout << endl;
  }
  return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main() {

string line, word;

vector<int> max_len(200, 0);

vector<vector<string>> lines;

while (getline(cin, line)) {

stringstream ss(line);

vector<string> line_words;

int column_idx = 0;

while (ss >> word) {

line_words.push_back(word);

max_len[column_idx] =

max(max_len[column_idx], static_cast<int>(word.length()));

column_idx += 1;

}

lines.push_back(line_words);

}

for (auto& line : lines) {

for (int i = 0; i < line.size(); ++i)

cout << line[i] << (i == line.size() - 1 ? "" // note this case

: string(max_len[i] - line[i].length() + 1, ' '));

cout << endl;

}

return 0;

}

#TODO

#TODO

AOAPC II UVaOJ

UVaOJ 1593 - Alignment of Code

问题描述

解法一：模拟