文件
3.20.2
3.20.3
3.20.4
3.20.5
3.20
3.27
4.10.1
4.21.2
4.21
4.3
4.6.2
4.6.3
4.6
5.10.1
5.17.1
5.17.2
5.2.1
5.4.2
5.4.3
5.4.4
5.4.5
5.4
7.28
7.29
7.31.1
8.12.1
8.12.2
8.12.3
8.14.1
8.29
BTree
CheckPermutation
CountSort
FirstKeyPosition
Heap
MergeSort
PreOrder
Queue
QuickSort
SameTree
SelectSort
SingleValueBTree
Sort
Stack
StatisticalCharacters
TakeAnApproximation
Traversal
WordAbbreviations
addTwoNumbers
canPermutePalindrome
compressString
exchangeBits
findLHS
findTilt
getDecimalValue
isEvenOddTree
isPrimerNumber
isSymmetric
makeGood
maxDepth
multiply
numColor
relativeSortArray
removeZeroSumSublists
replaceSpaces
reverseBetween
runningSum
searchInsert
searchRevolve
selectNumber7
sequence
singleKey
sortSentence
sumRootToLeaf
trailingZeroes.c
3.5_test.c
8.29.zip
Test_3_6.c
Test_3_6_3.c
Test_3_8_2.c
testDemo.txt
test_3_12_1.c
test_3_6_2.c
test_3_8_1.c
该仓库未声明开源许可证文件(LICENSE),使用请关注具体项目描述及其代码上游依赖。
克隆/下载
test_3_6_2.c 628 Bytes
一键复制 编辑 原始数据 按行查看 历史
dance 提交于 3年前 . 空心三角形图案
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
//ͼ
int main()
{
int n = 0;
while (~scanf("%d", &n))
{
int i = 0, j = 0;
for (i = 0; i < n; i++)
{
for (int j = 0; j <= i; j++)
{
if (i == n - 1)
{
printf("* ");
}
else
{
if (j == 0 || j == i)
printf("* ");
else
printf(" ");
}
}
printf("\n");
}
}
return 0;
}
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化