Xem thảo luận
Cải thiện bài viết
Lưu bài viết
Xem thảo luận
Cải thiện bài viết
Lưu bài viết
Đọc
Examples:
Input : bAwutndekWEdkd Output :AbEdWddekkntuw Explanation: Here we can see that letter ‘A’, ’E’, ’W’ are sorted as well as letters “b, d, d, d, e, k, k, n, t, u, w” are sorted but both appears alternately in the string as far as possible. Input :abbfDDhGFBvdFDGBNDasZVDFjkb Output :BaBaDbDbDbDdDfFhFjFkGsGvNVZ
Bàn luận
2] Count upper case characters in another array uCount[]
3] Modify strings using lCount[] and uCount[]
C++
#include
Cho một chuỗi chứa chữ thường và chữ hoa. Sắp xếp nó theo cách mà các chữ cái viết hoa và chữ thường xuất hiện một cách khác nhưng theo một cách được sắp xếp.
#define MAX 26
1] Đếm các ký tự chữ thường trong một mảng lcount [] & nbsp; 2] Đếm các ký tự trường hợp trên trong một mảng khác ucount [] & nbsp; 3] sửa đổi chuỗi bằng Lcount [] và ucount [] & nbsp;
{
using
namespace
std;
void
alternateSort[string& s]
AbEdWddekkntuw0____11
AbEdWddekkntuw2
AbEdWddekkntuw0____11
AbEdWddekkntuw5
#include
6#include
7#include
8#include
9
#include
1using
1
#include
6using
3using
4#include
9
AbEdWddekkntuw0
using
7AbEdWddekkntuw0____17
AbEdWddekkntuw8
AbEdWddekkntuw1
#include
0#include
1#include
2
AbEdWddekkntuw8
#include
4#include
5AbEdWddekkntuw0____11
namespace
0#include
6namespace
8
AbEdWddekkntuw0
namespace
2 namespace
3#include
1namespace
2 namespace
6
#include
6std;
7
#include
1using
7
#include
1#include
2 std;
1
#include
6std;
3#include
8 std;
5
#include
1namespace
2 #define MAX 26
2
#include
6#define MAX 26
4
#include
6void
3
#include
1using
7
AbEdWddekkntuw0
using
7using
7
#include
1#include
2 #define MAX 26
7
{
AbEdWddekkntuw0
alternateSort[string& s]
3alternateSort[string& s]
4alternateSort[string& s]
5AbEdWddekkntuw0
alternateSort[string& s]
7AbEdWddekkntuw0
alternateSort[string& s]
9{
0alternateSort[string& s]
5using
7
#include
6std;
3using
4 void
1
AbEdWddekkntuw1
alternateSort[string& s]
0Java
{
3 {
4
{
3 {
6
{
7 {
8 {
9
{
AbEdWddekkntuw00
AbEdWddekkntuw01
AbEdWddekkntuw02
AbEdWddekkntuw1
AbEdWddekkntuw04
AbEdWddekkntuw05
alternateSort[string& s]
5AbEdWddekkntuw0
AbEdWddekkntuw15
AbEdWddekkntuw16
{
7
AbEdWddekkntuw02
AbEdWddekkntuw09
AbEdWddekkntuw0____11
AbEdWddekkntuw13
____10
AbEdWddekkntuw1
AbEdWddekkntuw19
AbEdWddekkntuw20
AbEdWddekkntuw1
AbEdWddekkntuw22
____10
AbEdWddekkntuw1
AbEdWddekkntuw25
AbEdWddekkntuw20
AbEdWddekkntuw1
AbEdWddekkntuw22
#include
6#include
7#include
8#include
9
#include
1using
1
#include
6using
3using
4#include
9
AbEdWddekkntuw0
using
7____10
AbEdWddekkntuw7
AbEdWddekkntuw8
AbEdWddekkntuw1
AbEdWddekkntuw33
AbEdWddekkntuw34
AbEdWddekkntuw35
#include
1#include
2
AbEdWddekkntuw38
AbEdWddekkntuw0
{
Is
AbEdWddekkntuw70
namespace
8AbEdWddekkntuw0
namespace
2 namespace
3#include
1namespace
2 namespace
6
AbEdWddekkntuw70
std;
7#include
6using
7
#include
1#include
2 std;
1
AbEdWddekkntuw70
#define MAX 26
4#include
1namespace
2 #define MAX 26
2
#include
6#define MAX 26
4
#include
1#include
2 #define MAX 26
7
#include
6using
7
#include
1using
7
#include
6std;
3using
4 void
1
AbEdWddekkntuw0
using
7AbEdWddekkntuw1
alternateSort[string& s]
0AbEdWddekkntuw0
#include
19alternateSort[string& s]
4alternateSort[string& s]
5AbEdWddekkntuw0
#include
23using
7
using
7
C#
Java
{
3 {
4
{
3 {
6
{
7 {
8 {
9
AbEdWddekkntuw0
{
AbEdWddekkntuw00
AbEdWddekkntuw01
AbEdWddekkntuw02
AbEdWddekkntuw1
AbEdWddekkntuw04
AbEdWddekkntuw05
alternateSort[string& s]
5{
7
AbEdWddekkntuw02
AbEdWddekkntuw09
#include
1
AbEdWddekkntuw15
#include
49AbEdWddekkntuw0____11
AbEdWddekkntuw13
____10
AbEdWddekkntuw1
AbEdWddekkntuw19
AbEdWddekkntuw20
AbEdWddekkntuw1
AbEdWddekkntuw22
____10
AbEdWddekkntuw1
AbEdWddekkntuw25
AbEdWddekkntuw20
AbEdWddekkntuw1
AbEdWddekkntuw22
____10
AbEdWddekkntuw7
AbEdWddekkntuw8
AbEdWddekkntuw1
AbEdWddekkntuw33
AbEdWddekkntuw34
AbEdWddekkntuw35
AbEdWddekkntuw70
#include
7#include
8#include
9#include
6using
1
AbEdWddekkntuw70
using
3using
4#include
9#include
1using
7
#include
1#include
2
AbEdWddekkntuw38
#include
1{
Is
AbEdWddekkntuw70
#include
93AbEdWddekkntuw0
namespace
2 AbEdWddekkntuw62
#include
1namespace
2
AbEdWddekkntuw67
AbEdWddekkntuw34
AbEdWddekkntuw69
AbEdWddekkntuw70
using
04#include
6using
7
AbEdWddekkntuw70
AbEdWddekkntuw76
AbEdWddekkntuw15
AbEdWddekkntuw78
#include
8 AbEdWddekkntuw80
AbEdWddekkntuw70
#define MAX 26
4#include
1namespace
2
AbEdWddekkntuw87
AbEdWddekkntuw34
AbEdWddekkntuw69
#include
6#define MAX 26
4
AbEdWddekkntuw70
void
3#include
6using
7
#include
1using
7
#include
6std;
3using
4 void
1
AbEdWddekkntuw0
using
7AbEdWddekkntuw1
alternateSort[string& s]
0AbEdWddekkntuw0
{
Java
#include
1using
46
AbEdWddekkntuw0
using
7using
7
Python3
{
3 {
4
{
3 {
6
{
7 {
8 {
9
AbEdWddekkntuw00
AbEdWddekkntuw01
AbEdWddekkntuw02
AbEdWddekkntuw1
AbEdWddekkntuw04
AbEdWddekkntuw05
alternateSort[string& s]
5{
7
AbEdWddekkntuw02
AbEdWddekkntuw09
AbEdWddekkntuw0____11
AbEdWddekkntuw13
____10
AbEdWddekkntuw7
using
66using
67 using
68using
94#include
1#include
2using
97
#include
6using
99namespace
00namespace
01namespace
02
Các
#include
1using
1namespace
13
#include
6namespace
15namespace
00namespace
01namespace
02
Các
AbEdWddekkntuw0
using
66using
51 AbEdWddekkntuw34
____10namespace
32using
51
AbEdWddekkntuw34
____10namespace
36using
51
AbEdWddekkntuw34
AbEdWddekkntuw0
namespace
2namespace
41#include
1namespace
2namespace
444using
50 namespace
46
namespace
47namespace
48using
51using
51
AbEdWddekkntuw34
namespace
52#include
6using
66namespace
08using
51 namespace
10
#include
1#include
2namespace
44using
50namespace
52
Các
#include
6namespace
36namespace
08using
51 namespace
10
#include
6namespace
48namespace
02using
51 namespace
10
#include
1namespace
2namespace
86using
50 namespace
46
namespace
47namespace
90using
51using
51
AbEdWddekkntuw34
namespace
52#include
6namespace
32namespace
08using
51 namespace
10
#include
1#include
2namespace
86using
50namespace
52
Các
#include
6namespace
36namespace
08using
51 namespace
10
#include
6namespace
48namespace
02using
51 namespace
10
AbEdWddekkntuw0
std;
27std;
28#include
1namespace
2namespace
86using
50 namespace
46
std;
32std;
29
AbEdWddekkntuw69
namespace
47namespace
90using
51using
51 AbEdWddekkntuw
34namespace
52
std;
35
std;
36std;
37
#include
6namespace
32namespace
08using
51 namespace
10
Các
#include
6namespace
90namespace
02using
51 namespace
10
std;
29 using
51 alternateSort[string& s]
4
JavaScript
std;
36std;
39 std;
40
#include
1std;
42 std;
43
#include
1std;
42 #include
46
#include
6std;
71std;
72std;
73
std;
67using
1
namespace
47std;
77std;
78std;
73
#include
1using
7
#include
1std;
42 std;
49std;
50std;
51
#include
1std;
42 std;
54
AbEdWddekkntuw20
std;
56#include
1std;
42 std;
59
AbEdWddekkntuw20
std;
56#include
1
AbEdWddekkntuw7
AbEdWddekkntuw8
std;
42 #include
0#include
6std;
94std;
72std;
96
#include
6using
04
std;
67using
7
std;
67#include
2 std;
69
namespace
47#define MAX 26
4
#include
1namespace
2 namespace
3
#include
6std;
94std;
78#define MAX 26
12
#include
6void
3
std;
67using
7
#include
1using
7
std;
67namespace
2 std;
87
std;
36using
7
namespace
47#include
93
std;
36#define MAX 26
32
#define MAX 26
33
Output:
AbEdWddekkntuw
std;
67#include
2 #include
96 O[n].
std;
67namespace
2 #define MAX 26
03O[max[n,26]], where n is the length of the string.
std;
67#include
2 #define MAX 26
7