最新回答 / 慕少9104305
https://list.jd.com/search?keywo ... 1%32%2E%38%68%6B%70https://list.jd.com/search?keywo ... 1%32%2E%38%6E%64%6Fhttps://list.jd.com/search?keywo ... 0%B1%32%2E%38%79%76https://list.jd.com/search?keywo ... 0%B1%32%2E%38%72%77https://list.jd.com/search?keyw...
2022-01-15
最新回答 / 慕少9104305
https://www.oschina.net/search?i ... 1%32%2E%38%63%62%6Ahttps://www.oschina.net/search?i ... 0%B1%32%2E%38%6C%6Fhttps://www.oschina.net/search?i ... 1%32%2E%38%78%76%65https://www.oschina.net/search?i ... 0%B1%32%2E%38%78%68https://www.oschina.net/search?...
2022-01-13
最新回答 / 慕少9104305
https://www.chunyuyisheng.com/pc ... 1%32%2E%38%67%69%72https://www.chunyuyisheng.com/pc ... 1%32%2E%38%77%79%63https://www.chunyuyisheng.com/pc ... 0%B1%32%2E%38%70%75https://www.chunyuyisheng.com/pc ... 0%B1%32%2E%38%77%70https://www.chunyuyisheng.com/p...
2022-01-09
最贊回答 / shaw_Foo
想到了,應該是for循環(huán)的嵌套,第一層for循環(huán)執(zhí)行每一行的遍歷,所以實際上每一行都只有一次查找,不會有重復的情況;
2022-01-05
最贊回答 / 小白菜慢慢長大
長方形如下:#include <stdio.h>int main(){? ? int i, j, k;? ? for(i=1; i<6; i++)? ? {? ? ?? ? ? ? for(j=i;j>6;j++)??? ? ? ? {? ? ? ? ? ? printf(" ");??? ? ? ? }? ? ? ? for(k=1;k<=5;k++)?? ? ? ? {? ? ? ? ? ? printf("*");? ?? ? ? ? }? ? ? ? printf("...
2022-01-04
最新回答 / 慕姐7416298
http://physics.scu.edu.cn/search ... 1%32%2E%38%75%67%75http://physics.scu.edu.cn/search ... 1%32%2E%38%67%61%70http://physics.scu.edu.cn/search ... 0%B1%32%2E%38%76%6Fhttp://physics.scu.edu.cn/search ... 0%B1%32%2E%38%75%6Dhttp://physics.scu.edu.cn/searc...
2022-01-04