Дан список символов chars. Нужно развернуть chars и вернуть измененный список в качестве ответа. Использовать встроенную функцию разворота нельзя.
Пример 1:
Ввод: chars = ["p","e","r","f","e","c","t","i","o","n"] Вывод: ["n","o","i","t","c","e","f","r","e","p"]
Пример 2:
Ввод: chars = ["r","e","v","e","r","s","e"] Вывод: ["e","s","r","e","v","e","r"]
Ограничения:
len(chars) >= 0chars содержит только ascii символыpublic class Solution {
public static List<char> Reverse(List<char> chars) {
int p1 = 0;
int p2 = chars.Count - 1;
while (p1 < p2) {
char temp = chars[p1];
chars[p1] = chars[p2];
chars[p2] = temp;
p1++;
p2--;
}
return chars;
}
}#include <vector>
using namespace std;
vector<char> reverse(vector<char>& chars) {
int p1 = 0;
int p2 = chars.size() - 1;
while (p1 < p2) {
swap(chars[p1], chars[p2]);
p1++;
p2--;
}
return chars;
}package main
func reverse(chars []rune) []rune {
p1 := 0
p2 := len(chars) - 1
for p1 < p2 {
chars[p1], chars[p2] = chars[p2], chars[p1]
p1++
p2--
}
return chars
}import java.util.*;
public class Solution {
public List<Character> reverse(List<Character> chars) {
int p1 = 0;
int p2 = chars.size() - 1;
while (p1 < p2) {
char temp = chars.get(p1);
chars.set(p1, chars.get(p2));
chars.set(p2, temp);
p1++;
p2--;
}
return chars;
}
}from typing import *
def reverse(chars: List[str]) -> List[str]:
p1 = 0
p2 = len(chars) - 1
while p1 < p2:
chars[p1], chars[p2] = chars[p2], chars[p1]
p1 += 1
p2 -= 1
return chars/**
* @param {string[]} chars
* @returns {string[]}
*/
export function reverse(chars) {
let p1 = 0;
let p2 = chars.length - 1;
while (p1 < p2) {
[chars[p1], chars[p2]] = [chars[p2], chars[p1]];
p1++;
p2--;
}
return chars;
}Оценка сложности
O(n), где n - длина charsO(1)