| |

VerySource

 Forgot password?
 Register
Search
View: 20|Reply: 4

★ Efficient algorithm exhausts all upper and lower case forms of a string

[Copy link]

1

Threads

10

Posts

8

Credits

Newbie

Rank: 1

Credits
8

 China

Post time: 2020-3-5 21:30:01
| Show all posts |Read mode
Such as the string 'aa', there are aa, aA, Aa, AA

To consider the case of non-English characters, test the string:
abcd
ab1d
1111

No recursion.
Reply

Use magic Report

0

Threads

3

Posts

4

Credits

Newbie

Rank: 1

Credits
4

 China

Post time: 2020-5-26 12:30:02
| Show all posts
Binary means that each digit is case-sensitive, looping from 0 to 2 ^ n.
(Meet non-letter marks, skip a paragraph more)
Reply

Use magic Report

1

Threads

10

Posts

8

Credits

Newbie

Rank: 1

Credits
8

 Great Britain

 Author| Post time: 2020-5-27 01:00:01
| Show all posts
I think so too, how do non-letters jump?
Reply

Use magic Report

0

Threads

10

Posts

10

Credits

Newbie

Rank: 1

Credits
10

 China

Post time: 2020-6-26 22:45:01
| Show all posts
What does it do?
Reply

Use magic Report

0

Threads

3

Posts

4

Credits

Newbie

Rank: 1

Credits
4

 China

Post time: 2020-7-14 14:15:01
| Show all posts
Like ab1d
0000
0001
Then go directly to
0100
...
It can also be regarded as removing one, probably thinking ;)
Reply

Use magic Report

You have to log in before you can reply Login | Register

Points Rules

Contact us|Archive|Mobile|CopyRight © 2008-2020|verysource.com ( 京ICP备17048824号-1 )

Quick Reply To Top Return to the list