今天是腊月二十九,挂灯笼喽!
#include <stdio.h>
#include <string.h>
int main() {
char str[1001] = {'\0'};
while (scanf("%s", str) != EOF) {//输入的是字符串
int len = strlen(str);
for(int i = 0;i<len-1;i++)
{
for(int j = 0;j<len - 1 -i;j++)
{
if(str[j]-str[j+1]>0)
{
char tmp = str[j];
str[j] = str[j+1];
str[j+1] = tmp;
}
}
}
printf("%s\n",str);
}
return 0;
}
要找到数组的中心下标,我们可以采用以下步骤:
int pivotIndex(int* nums, int numsSize) {
int totalSum = 0;
for (int i = 0; i < numsSize; i++) {
totalSum += nums[i];
}
int leftSum = 0;
for (int j = 0; j < numsSize; j++) {
if (rightSum == totalSum - leftSum - nums[j]) {
return j;
}
leftSum += nums[j]; //更新下标
}
return -1;
}