Reverse Vowels of a String

https://leetcode.com/problems/reverse-vowels-of-a-string/
给定一个字符串,字符串两端属于元音字母的字符互换位置;
C代码:

char* reverseVowels(char* s) {
    int start = 0;
    int end = strlen(s)-1;
    char lChar;
    char rChar;
    int i = start,j = end;
    while(i < j)
    {
        while(i <= end)
        {
            if(s[i] == 'U' || s[i] == 'A' || s[i] == 'E' || s[i] == 'I' || s[i] == 'O' || s[i] == 'a' || s[i] == 'e' || s[i] == 'i' || s[i] == 'o' || s[i] == 'u')
            {
                lChar = s[i];
                break;
            }
            i++;
        }

        while(j >= 0)
        {
            if(s[j] == 'U' || s[j] == 'A' || s[j] == 'E' || s[j] == 'I' || s[j] == 'O' ||  s[j] == 'a' || s[j] == 'e' || s[j] == 'i' || s[j] == 'o' || s[j] == 'u')
            {
                rChar = s[j];
                break;
            }
            j--;
        }

        if(i < j)
        {
            s[i] = rChar;
            s[j] = lChar;
            i++;
            j--;
        }
    }
    return s;
}

Java代码:

public class Solution {
    public String reverseVowels(String s) {
        int start = 0;
        int end = s.length() - 1;
        int i = start,j = end;
        char temp;
        char[] str = s.toCharArray();
        while(i < j)
        {
            while(i <= end)
            {
                if(str[i] == 'U' || str[i] == 'A' || str[i] == 'E' || str[i] == 'I' || str[i] == 'O' || str[i] == 'a' || str[i] == 'e' || str[i] == 'i' || str[i] == 'o' || str[i] == 'u')
                {

                    break;
                }
                i++;
            }

            while(j >= 0)
            {
                if(str[j] == 'U' || str[j] == 'A' || str[j] == 'E' || str[j] == 'I' || str[j] == 'O' || str[j] == 'a' || str[j] == 'e' || str[j] == 'i' || str[j] == 'o' || str[j] == 'u')
                {

                    break;
                }
                j--;
            }

            if(i < j)
            {
                temp = str[i];
                str[i] = str[j];
                str[j] = temp;
                i++;
                j--;
            }
        }
        return String.valueOf(str);
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值