当前位置:网站首页>Leetcode skimming questions_ Invert vowels in a string
Leetcode skimming questions_ Invert vowels in a string
2022-07-06 01:24:00 【Figure throne】
Title Description
Java resolvent
import java.util.*;
class Solution {
public String reverseVowels(String s) {
// ArrayList It is used to judge whether a character is in an array
Collection c = new ArrayList();
c.add('a');c.add('e');c.add('i');c.add('o');c.add('u');
c.add('A');c.add('E');c.add('I');c.add('O');c.add('U');
int head = 0;
int tail = s.length() - 1;
// Modifying a character in a string requires StringBuilder
StringBuilder s1 = new StringBuilder(s);
while(head < tail)
{
char a1 = s1.charAt(head);
char a2 = s1.charAt(tail);
if(!c.contains(a1))
{
head++;
}
else if(!c.contains(a2))
{
tail--;
}
else
{
s1.setCharAt(head, a2);
s1.setCharAt(tail, a1);
head++;
tail--;
}
}
String s2 = s1.toString();
return s2;
}
}
C Language solutions
int nocontains(char a)
{
if(a != 'a' && a != 'A' && a != 'e' && a != 'E' && a != 'i' && a != 'I' && a != 'o' && a != 'O' && a != 'u' && a != 'U')
{
return 1;
}
return 0;
}
char * reverseVowels(char * s){
int head = 0;
int tail;
tail = strlen(s) - 1;
while(head < tail)
{
char a;
char b;
a = s[head];
b = s[tail];
if(nocontains(a))
{
head++;
}
else if(nocontains(b))
{
tail--;
}
else
{
s[head] = b;
s[tail] = a;
head++;
tail--;
}
}
return s;
}
边栏推荐
- 普通人下场全球贸易,新一轮结构性机会浮出水面
- Convert binary search tree into cumulative tree (reverse middle order traversal)
- Leetcode 208. Implement trie (prefix tree)
- 【全網最全】 |MySQL EXPLAIN 完全解讀
- Folio.ink 免费、快速、易用的图片分享工具
- Condition and AQS principle
- Unity | two ways to realize facial drive
- Unity VR resource flash surface in scene
- SSH login is stuck and disconnected
- Test de vulnérabilité de téléchargement de fichiers basé sur dvwa
猜你喜欢
False breakthroughs in the trend of London Silver
Vulhub vulnerability recurrence 74_ Wordpress
Convert binary search tree into cumulative tree (reverse middle order traversal)
Threedposetracker project resolution
伦敦银走势中的假突破
Finding the nearest common ancestor of binary search tree by recursion
yii中console方法调用,yii console定时任务
ADS-NPU芯片架构设计的五大挑战
BiShe - College Student Association Management System Based on SSM
Idea sets the default line break for global newly created files
随机推荐
朝招金安全吗 会不会亏损本金
A glimpse of spir-v
ORA-00030
Convert binary search tree into cumulative tree (reverse middle order traversal)
2020.2.13
Four commonly used techniques for anti aliasing
[Arduino syntax - structure]
VMware Tools installation error: unable to automatically install vsock driver
General operation method of spot Silver
Vulhub vulnerability recurrence 75_ XStream
How to see the K-line chart of gold price trend?
Vulhub vulnerability recurrence 74_ Wordpress
Use of crawler manual 02 requests
【第30天】给定一个整数 n ,求它的因数之和
282. Stone consolidation (interval DP)
Docker compose配置MySQL并实现远程连接
Development trend of Ali Taobao fine sorting model
The inconsistency between the versions of dynamic library and static library will lead to bugs
ctf. Show PHP feature (89~110)
[le plus complet du réseau] | interprétation complète de MySQL explicite