Skip to main content
We’ve updated our Terms of Service. A new AI Addendum clarifies how Stack Overflow utilizes AI interactions.
Code Golf

Return to Answer

Commonmark migration
Source Link

#C#, (削除) 525 (削除ここまで) 474 Bytes

C#, (削除) 525 (削除ここまで) 474 Bytes

#C#, (削除) 525 (削除ここまで) 474 Bytes

C#, (削除) 525 (削除ここまで) 474 Bytes

Saved more bytes after another tip
Source Link
Pete Arden
  • 1.2k
  • 7
  • 9

#C#, 507(削除) 525 (削除ここまで) 474 Bytes

Edit: Saved 1851 Bytes thanks to @steenbergh

string W(string s){var l=s.Length;var a=new char[2*l+1,2*l+1];int x=2*l/2;int y=2*l/2;int d=0;for(int i=0;i<l;i++){switch(char.ToUpper(s[i])){case'U':d=3;break;case'D':d=1;break;case'L':d=2;break;case'R':d=0;break;default:break;d=0;break;}a[y,x]=s[i];switch(d){case 0:x+=1;break;case 1:y+=1;break;case 2:x-=1;break;case 3:y-=1;break;default:break;=1;break;}}string o="";for(int i=0;i<2*l+1;i++){string t="";for(int j=0;j<2*l+1;j++)t+=a[i,j]+"";o += t == stringj]+"";o+=t==string.Join("",Enumerable.Repeat('0円',2*l+1))?"":(t+"\r\n");}return o;}

public string W(string s)
{
 var l = s.Length;
 var a = new char[2 * l + 1, 2 * l + 1];
 int x = 2 * l / 2;
 int y = 2 * l / 2;
 int d = 0;
 for (int i = 0; i < l; i++)
 {
 switch (char.ToUpper(s[i]))
 {
 case 'U':
 d = 3;
 break;
 case 'D':
 d = 1;
 break;
 case 'L':
 d = 2;
 break;
 case 'R':
 d = 0;
 break;
 default:
  break;
 }
 a[y, x] = s[i];
 switch (d)
 {
 case 0:
 x += 1;
 break;
 case 1:
 y += 1;
 break;
 case 2:
 x -= 1;
 break;
 case 3:
 y -= 1;
 break;
 default:
 break;
 }
 }
 string o = "";
 for (int i = 0; i < 2 * l + 1; i++)
 {
 string t = "";
 for (int j = 0; j < 2 * l + 1; j++)
 t += a[i, j] + "";
 o += t == string.Join("", Enumerable.Repeat('0円', 2 * l + 1)) ? "" : (t + "\r\n");
 }
 return o;
}

#C#, 507 Bytes

Edit: Saved 18 Bytes thanks to @steenbergh

string W(string s){var l=s.Length;var a=new char[2*l+1,2*l+1];int x=2*l/2;int y=2*l/2;int d=0;for(int i=0;i<l;i++){switch(char.ToUpper(s[i])){case'U':d=3;break;case'D':d=1;break;case'L':d=2;break;case'R':d=0;break;default:break;}a[y,x]=s[i];switch(d){case 0:x+=1;break;case 1:y+=1;break;case 2:x-=1;break;case 3:y-=1;break;default:break;}}string o="";for(int i=0;i<2*l+1;i++){string t="";for(int j=0;j<2*l+1;j++)t+=a[i,j]+"";o += t == string.Join("",Enumerable.Repeat('0円',2*l+1))?"":(t+"\r\n");}return o;}

public string W(string s)
{
 var l = s.Length;
 var a = new char[2 * l + 1, 2 * l + 1];
 int x = 2 * l / 2;
 int y = 2 * l / 2;
 int d = 0;
 for (int i = 0; i < l; i++)
 {
 switch (char.ToUpper(s[i]))
 {
 case 'U':
 d = 3;
 break;
 case 'D':
 d = 1;
 break;
 case 'L':
 d = 2;
 break;
 case 'R':
 d = 0;
 break;
 default:
  break;
 }
 a[y, x] = s[i];
 switch (d)
 {
 case 0:
 x += 1;
 break;
 case 1:
 y += 1;
 break;
 case 2:
 x -= 1;
 break;
 case 3:
 y -= 1;
 break;
 default:
 break;
 }
 }
 string o = "";
 for (int i = 0; i < 2 * l + 1; i++)
 {
 string t = "";
 for (int j = 0; j < 2 * l + 1; j++)
 t += a[i, j] + "";
 o += t == string.Join("", Enumerable.Repeat('0円', 2 * l + 1)) ? "" : (t + "\r\n");
 }
 return o;
}

#C#, (削除) 525 (削除ここまで) 474 Bytes

Edit: Saved 51 Bytes thanks to @steenbergh

string W(string s){var l=s.Length;var a=new char[2*l+1,2*l+1];int x=2*l/2;int y=2*l/2;int d=0;for(int i=0;i<l;i++){switch(char.ToUpper(s[i])){case'U':d=3;break;case'D':d=1;break;case'L':d=2;break;case'R':d=0;break;}a[y,x]=s[i];switch(d){case 0:x+=1;break;case 1:y+=1;break;case 2:x-=1;break;case 3:y-=1;break;}}string o="";for(int i=0;i<2*l+1;i++){string t="";for(int j=0;j<2*l+1;j++)t+=a[i,j]+"";o+=t==string.Join("",Enumerable.Repeat('0円',2*l+1))?"":(t+"\r\n");}return o;}

public string W(string s)
{
 var l = s.Length;
 var a = new char[2 * l + 1, 2 * l + 1];
 int x = 2 * l / 2;
 int y = 2 * l / 2;
 int d = 0;
 for (int i = 0; i < l; i++)
 {
 switch (char.ToUpper(s[i]))
 {
 case 'U':
 d = 3;
 break;
 case 'D':
 d = 1;
 break;
 case 'L':
 d = 2;
 break;
 case 'R':
 d = 0;
 break;
 }
 a[y, x] = s[i];
 switch (d)
 {
 case 0:
 x += 1;
 break;
 case 1:
 y += 1;
 break;
 case 2:
 x -= 1;
 break;
 case 3:
 y -= 1;
 break;
 }
 }
 string o = "";
 for (int i = 0; i < 2 * l + 1; i++)
 {
 string t = "";
 for (int j = 0; j < 2 * l + 1; j++)
 t += a[i, j] + "";
 o += t == string.Join("", Enumerable.Repeat('0円', 2 * l + 1)) ? "" : (t + "\r\n");
 }
 return o;
}
Saved 18 bytes after a tip
Source Link
Pete Arden
  • 1.2k
  • 7
  • 9

#C#, 525507 Bytes

Edit: Saved 18 Bytes thanks to @steenbergh

string W(string s){var l=s.Length;var a=new char[2*l+1,2*l+1];int x=2*l/2;int y=2*l/2;int d=0;for(int i=0;i<l;i++){switch(char.ToUpper(s[i])){case'u':case'U':d=3;break;case'd':case'D':d=1;break;case'l':case'L'd=3;break;case'D':d=2;break;case'r'd=1;break;case'L':case'R'd=2;break;case'R':d=0;break;default:break;}a[y, x]=s[i];switch(d){case 0:x+=1;break;case 1:y+=1;break;case 2:x-=1;break;case 3:y-=1;break;default:break;}}string o="";for(int i=0;i<2*l+1;i++){string t="";for(int j=0;j<2*l+1;j++)t+=a[i,j]+"";o += t == string.Join("",Enumerable.Repeat('0円',2*l+1))?"":(t+"\r\n");}return o;}

public string W(string s)
{
 var l = s.Length;
 var a = new char[2 * l + 1, 2 * l + 1];
 int x = 2 * l / 2;
 int y = 2 * l / 2;
 int d = 0;
 for (int i = 0; i < l; i++)
 {
 switch (char.ToUpper(s[i]))
 {
 case 'u':
  case 'U':
 d = 3;
 break;
 case 'd':
 case 'D':
 d = 1;
 break;
 case 'l':
  case 'L':
 d = 2;
 break;
 case 'r':
  case 'R':
 d = 0;
 break;
 default:
 break;
 }
 a[y, x] = s[i];
 switch (d)
 {
 case 0:
 x += 1;
 break;
 case 1:
 y += 1;
 break;
 case 2:
 x -= 1;
 break;
 case 3:
 y -= 1;
 break;
 default:
 break;
 }
 }
 string o = "";
 for (int i = 0; i < 2 * l + 1; i++)
 {
 string t = "";
 for (int j = 0; j < 2 * l + 1; j++)
 t += a[i, j] + "";
 o += t == string.Join("", Enumerable.Repeat('0円', 2 * l + 1)) ? "" : (t + "\r\n");
 }
 return o;
}

var walkTheWords = new WalkTheWords();
Console.WriteLine(walkTheWords.W("codegolf and programming puzzles"));
 cod 
 e 
 g 
 o 
 dna fl sel 
 z 
 p z 
 rogramming pu

#C#, 525 Bytes

string W(string s){var l=s.Length;var a=new char[2*l+1,2*l+1];int x=2*l/2;int y=2*l/2;int d=0;for(int i=0;i<l;i++){switch(s[i]){case'u':case'U':d=3;break;case'd':case'D':d=1;break;case'l':case'L':d=2;break;case'r':case'R':d=0;break;default:break;}a[y, x]=s[i];switch(d){case 0:x+=1;break;case 1:y+=1;break;case 2:x-=1;break;case 3:y-=1;break;default:break;}}string o="";for(int i=0;i<2*l+1;i++){string t="";for(int j=0;j<2*l+1;j++)t+=a[i,j]+"";o += t == string.Join("",Enumerable.Repeat('0円',2*l+1))?"":(t+"\r\n");}return o;}

public string W(string s)
{
 var l = s.Length;
 var a = new char[2 * l + 1, 2 * l + 1];
 int x = 2 * l / 2;
 int y = 2 * l / 2;
 int d = 0;
 for (int i = 0; i < l; i++)
 {
 switch (s[i])
 {
 case 'u':
  case 'U':
 d = 3;
 break;
 case 'd':
 case 'D':
 d = 1;
 break;
 case 'l':
  case 'L':
 d = 2;
 break;
 case 'r':
  case 'R':
 d = 0;
 break;
 default:
 break;
 }
 a[y, x] = s[i];
 switch (d)
 {
 case 0:
 x += 1;
 break;
 case 1:
 y += 1;
 break;
 case 2:
 x -= 1;
 break;
 case 3:
 y -= 1;
 break;
 default:
 break;
 }
 }
 string o = "";
 for (int i = 0; i < 2 * l + 1; i++)
 {
 string t = "";
 for (int j = 0; j < 2 * l + 1; j++)
 t += a[i, j] + "";
 o += t == string.Join("", Enumerable.Repeat('0円', 2 * l + 1)) ? "" : (t + "\r\n");
 }
 return o;
}

var walkTheWords = new WalkTheWords();
Console.WriteLine(walkTheWords.W("codegolf and programming puzzles"));
 cod 
 e 
 g 
 o 
 dna fl sel 
 z 
 p z 
 rogramming pu

#C#, 507 Bytes

Edit: Saved 18 Bytes thanks to @steenbergh

string W(string s){var l=s.Length;var a=new char[2*l+1,2*l+1];int x=2*l/2;int y=2*l/2;int d=0;for(int i=0;i<l;i++){switch(char.ToUpper(s[i])){case'U':d=3;break;case'D':d=1;break;case'L':d=2;break;case'R':d=0;break;default:break;}a[y, x]=s[i];switch(d){case 0:x+=1;break;case 1:y+=1;break;case 2:x-=1;break;case 3:y-=1;break;default:break;}}string o="";for(int i=0;i<2*l+1;i++){string t="";for(int j=0;j<2*l+1;j++)t+=a[i,j]+"";o += t == string.Join("",Enumerable.Repeat('0円',2*l+1))?"":(t+"\r\n");}return o;}

public string W(string s)
{
 var l = s.Length;
 var a = new char[2 * l + 1, 2 * l + 1];
 int x = 2 * l / 2;
 int y = 2 * l / 2;
 int d = 0;
 for (int i = 0; i < l; i++)
 {
 switch (char.ToUpper(s[i]))
 {
 case 'U':
 d = 3;
 break;
 case 'D':
 d = 1;
 break;
 case 'L':
 d = 2;
 break;
 case 'R':
 d = 0;
 break;
 default:
 break;
 }
 a[y, x] = s[i];
 switch (d)
 {
 case 0:
 x += 1;
 break;
 case 1:
 y += 1;
 break;
 case 2:
 x -= 1;
 break;
 case 3:
 y -= 1;
 break;
 default:
 break;
 }
 }
 string o = "";
 for (int i = 0; i < 2 * l + 1; i++)
 {
 string t = "";
 for (int j = 0; j < 2 * l + 1; j++)
 t += a[i, j] + "";
 o += t == string.Join("", Enumerable.Repeat('0円', 2 * l + 1)) ? "" : (t + "\r\n");
 }
 return o;
}

var walkTheWords = new WalkTheWords();
Console.WriteLine(walkTheWords.W("codegolf and programming puzzles"));
 cod 
 e 
 g 
 o 
 dna fl sel 
 z 
 p z 
 rogramming pu
Source Link
Pete Arden
  • 1.2k
  • 7
  • 9
Loading

AltStyle によって変換されたページ (->オリジナル) /