Snake node movement functionLinked List Delete Node FunctionRefining AI movement logicTile map movement by touchTop-down movementNext node of a node in Binary search treeMovement around a large mapJava Snake gameImplementing movement in a Pacman gameSnake in JavaFXSnake Game with Swing

Return the Closest Prime Number

Class Action - which options I have?

How do I extract a value from a time formatted value in excel?

Lay out the Carpet

Opposite of a diet

Different result between scanning in Epson's "color negative film" mode and scanning in positive -> invert curve in post?

How can I get through very long and very dry, but also very useful technical documents when learning a new tool?

Where does the Z80 processor start executing from?

What is the intuitive meaning of having a linear relationship between the logs of two variables?

Was Spock the First Vulcan in Starfleet?

Is expanding the research of a group into machine learning as a PhD student risky?

Two monoidal structures and copowering

Did Dumbledore lie to Harry about how long he had James Potter's invisibility cloak when he was examining it? If so, why?

Method to test if a number is a perfect power?

How do I rename a Linux host without needing to reboot for the rename to take effect?

What can we do to stop prior company from asking us questions?

Is it appropriate to ask a job candidate if we can record their interview?

Proof of work - lottery approach

Gears on left are inverse to gears on right?

Do sorcerers' Subtle Spells require a skill check to be unseen?

Term for the "extreme-extension" version of a straw man fallacy?

How does it work when somebody invests in my business?

Short story about space worker geeks who zone out by 'listening' to radiation from stars

How to Reset Passwords on Multiple Websites Easily?



Snake node movement function


Linked List Delete Node FunctionRefining AI movement logicTile map movement by touchTop-down movementNext node of a node in Binary search treeMovement around a large mapJava Snake gameImplementing movement in a Pacman gameSnake in JavaFXSnake Game with Swing













0












$begingroup$


Probably all of us remember a game called Snake, where you have to eat as many apples as you can. As you may guess your task is to write a program which determines whether our snake wins the game or it ends up eating itself. Snake moves along an infinitely large board. It can turn left, right or go straight. Also, the snake - when going straight - can eat an apple under the condition it is in front of him. If such a scenario occurs our friend extends onto a cell where the meal took place. The initial snake length is 1.



Input:



The first line of the input contains the number of tests t (t < 1001). Each of the next t lines consists of an integer n (n < 2401) and n characters describing snake's movements. Each character is one of four letters: 'L', 'R', 'F' or 'E'. 'L' - snake goes on the field on his left, 'R' - snake goes right, 'F' - snake goes on the field in front of him, 'E' - as previous but with eating an apple.



Output:



For each test, you should print YES if the snake survives the whole game without dying or otherwise print the number of the step in which the snake bites itself.



Example



Input:



2



6 FLERFF



8 EEEELLLL



Output:



YES



7



I have tried it a lot but unable to implement the correct logic, please help me. Thanks.



import java.util.LinkedList;
import java.util.Scanner;
public class SnakePuzzle

private static Coordinates coordinates;
private static Scanner scan;
public static void main(String [] args)
try
scan = new Scanner(System.in);
int t=scan.nextInt();
for(int i=0;i<t;i++)
if(scan.hasNext())
int n=scan.nextInt();
String s=scan.next();

checkSnake(n,s);



catch (Exception e)



public static void checkSnake(int n, String s)
LinkedList<Coordinates> l=new LinkedList<>();
Coordinates c=new Coordinates(0, 0);
l.addFirst(c);
int count=0;
for(int i=0;i<s.length();i++)
if(s.charAt(i)=='E')
Coordinates c1=new Coordinates(0, 1);
l.addFirst(c1);
count++;

if(s.charAt(i)=='F')
l.removeLast();
Coordinates c1=new Coordinates(0, 1);
l.addFirst(c1);
count++;

if(s.charAt(i)=='L')
l.removeLast();
Coordinates c1=new Coordinates(-1, 0);
l.addFirst(c1);
count++;

if(s.charAt(i)=='F')
l.removeLast();
Coordinates c1=new Coordinates(1, 0);
l.addFirst(c1);
count++;

if(l.contains(c))
System.out.println(count);


if(count==n)
System.out.println("yes");





class Coordinates
int x;
int y;

Coordinates(int x, int y)
this.x =x;
this.y =y;


public int getX()
return x;


public void setX(int x)
this.x = x;


public int getY()
return y;


public void setY(int y)
this.y = y;











share







New contributor




Prashant Balotra is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$
















    0












    $begingroup$


    Probably all of us remember a game called Snake, where you have to eat as many apples as you can. As you may guess your task is to write a program which determines whether our snake wins the game or it ends up eating itself. Snake moves along an infinitely large board. It can turn left, right or go straight. Also, the snake - when going straight - can eat an apple under the condition it is in front of him. If such a scenario occurs our friend extends onto a cell where the meal took place. The initial snake length is 1.



    Input:



    The first line of the input contains the number of tests t (t < 1001). Each of the next t lines consists of an integer n (n < 2401) and n characters describing snake's movements. Each character is one of four letters: 'L', 'R', 'F' or 'E'. 'L' - snake goes on the field on his left, 'R' - snake goes right, 'F' - snake goes on the field in front of him, 'E' - as previous but with eating an apple.



    Output:



    For each test, you should print YES if the snake survives the whole game without dying or otherwise print the number of the step in which the snake bites itself.



    Example



    Input:



    2



    6 FLERFF



    8 EEEELLLL



    Output:



    YES



    7



    I have tried it a lot but unable to implement the correct logic, please help me. Thanks.



    import java.util.LinkedList;
    import java.util.Scanner;
    public class SnakePuzzle

    private static Coordinates coordinates;
    private static Scanner scan;
    public static void main(String [] args)
    try
    scan = new Scanner(System.in);
    int t=scan.nextInt();
    for(int i=0;i<t;i++)
    if(scan.hasNext())
    int n=scan.nextInt();
    String s=scan.next();

    checkSnake(n,s);



    catch (Exception e)



    public static void checkSnake(int n, String s)
    LinkedList<Coordinates> l=new LinkedList<>();
    Coordinates c=new Coordinates(0, 0);
    l.addFirst(c);
    int count=0;
    for(int i=0;i<s.length();i++)
    if(s.charAt(i)=='E')
    Coordinates c1=new Coordinates(0, 1);
    l.addFirst(c1);
    count++;

    if(s.charAt(i)=='F')
    l.removeLast();
    Coordinates c1=new Coordinates(0, 1);
    l.addFirst(c1);
    count++;

    if(s.charAt(i)=='L')
    l.removeLast();
    Coordinates c1=new Coordinates(-1, 0);
    l.addFirst(c1);
    count++;

    if(s.charAt(i)=='F')
    l.removeLast();
    Coordinates c1=new Coordinates(1, 0);
    l.addFirst(c1);
    count++;

    if(l.contains(c))
    System.out.println(count);


    if(count==n)
    System.out.println("yes");





    class Coordinates
    int x;
    int y;

    Coordinates(int x, int y)
    this.x =x;
    this.y =y;


    public int getX()
    return x;


    public void setX(int x)
    this.x = x;


    public int getY()
    return y;


    public void setY(int y)
    this.y = y;











    share







    New contributor




    Prashant Balotra is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.







    $endgroup$














      0












      0








      0





      $begingroup$


      Probably all of us remember a game called Snake, where you have to eat as many apples as you can. As you may guess your task is to write a program which determines whether our snake wins the game or it ends up eating itself. Snake moves along an infinitely large board. It can turn left, right or go straight. Also, the snake - when going straight - can eat an apple under the condition it is in front of him. If such a scenario occurs our friend extends onto a cell where the meal took place. The initial snake length is 1.



      Input:



      The first line of the input contains the number of tests t (t < 1001). Each of the next t lines consists of an integer n (n < 2401) and n characters describing snake's movements. Each character is one of four letters: 'L', 'R', 'F' or 'E'. 'L' - snake goes on the field on his left, 'R' - snake goes right, 'F' - snake goes on the field in front of him, 'E' - as previous but with eating an apple.



      Output:



      For each test, you should print YES if the snake survives the whole game without dying or otherwise print the number of the step in which the snake bites itself.



      Example



      Input:



      2



      6 FLERFF



      8 EEEELLLL



      Output:



      YES



      7



      I have tried it a lot but unable to implement the correct logic, please help me. Thanks.



      import java.util.LinkedList;
      import java.util.Scanner;
      public class SnakePuzzle

      private static Coordinates coordinates;
      private static Scanner scan;
      public static void main(String [] args)
      try
      scan = new Scanner(System.in);
      int t=scan.nextInt();
      for(int i=0;i<t;i++)
      if(scan.hasNext())
      int n=scan.nextInt();
      String s=scan.next();

      checkSnake(n,s);



      catch (Exception e)



      public static void checkSnake(int n, String s)
      LinkedList<Coordinates> l=new LinkedList<>();
      Coordinates c=new Coordinates(0, 0);
      l.addFirst(c);
      int count=0;
      for(int i=0;i<s.length();i++)
      if(s.charAt(i)=='E')
      Coordinates c1=new Coordinates(0, 1);
      l.addFirst(c1);
      count++;

      if(s.charAt(i)=='F')
      l.removeLast();
      Coordinates c1=new Coordinates(0, 1);
      l.addFirst(c1);
      count++;

      if(s.charAt(i)=='L')
      l.removeLast();
      Coordinates c1=new Coordinates(-1, 0);
      l.addFirst(c1);
      count++;

      if(s.charAt(i)=='F')
      l.removeLast();
      Coordinates c1=new Coordinates(1, 0);
      l.addFirst(c1);
      count++;

      if(l.contains(c))
      System.out.println(count);


      if(count==n)
      System.out.println("yes");





      class Coordinates
      int x;
      int y;

      Coordinates(int x, int y)
      this.x =x;
      this.y =y;


      public int getX()
      return x;


      public void setX(int x)
      this.x = x;


      public int getY()
      return y;


      public void setY(int y)
      this.y = y;











      share







      New contributor




      Prashant Balotra is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.







      $endgroup$




      Probably all of us remember a game called Snake, where you have to eat as many apples as you can. As you may guess your task is to write a program which determines whether our snake wins the game or it ends up eating itself. Snake moves along an infinitely large board. It can turn left, right or go straight. Also, the snake - when going straight - can eat an apple under the condition it is in front of him. If such a scenario occurs our friend extends onto a cell where the meal took place. The initial snake length is 1.



      Input:



      The first line of the input contains the number of tests t (t < 1001). Each of the next t lines consists of an integer n (n < 2401) and n characters describing snake's movements. Each character is one of four letters: 'L', 'R', 'F' or 'E'. 'L' - snake goes on the field on his left, 'R' - snake goes right, 'F' - snake goes on the field in front of him, 'E' - as previous but with eating an apple.



      Output:



      For each test, you should print YES if the snake survives the whole game without dying or otherwise print the number of the step in which the snake bites itself.



      Example



      Input:



      2



      6 FLERFF



      8 EEEELLLL



      Output:



      YES



      7



      I have tried it a lot but unable to implement the correct logic, please help me. Thanks.



      import java.util.LinkedList;
      import java.util.Scanner;
      public class SnakePuzzle

      private static Coordinates coordinates;
      private static Scanner scan;
      public static void main(String [] args)
      try
      scan = new Scanner(System.in);
      int t=scan.nextInt();
      for(int i=0;i<t;i++)
      if(scan.hasNext())
      int n=scan.nextInt();
      String s=scan.next();

      checkSnake(n,s);



      catch (Exception e)



      public static void checkSnake(int n, String s)
      LinkedList<Coordinates> l=new LinkedList<>();
      Coordinates c=new Coordinates(0, 0);
      l.addFirst(c);
      int count=0;
      for(int i=0;i<s.length();i++)
      if(s.charAt(i)=='E')
      Coordinates c1=new Coordinates(0, 1);
      l.addFirst(c1);
      count++;

      if(s.charAt(i)=='F')
      l.removeLast();
      Coordinates c1=new Coordinates(0, 1);
      l.addFirst(c1);
      count++;

      if(s.charAt(i)=='L')
      l.removeLast();
      Coordinates c1=new Coordinates(-1, 0);
      l.addFirst(c1);
      count++;

      if(s.charAt(i)=='F')
      l.removeLast();
      Coordinates c1=new Coordinates(1, 0);
      l.addFirst(c1);
      count++;

      if(l.contains(c))
      System.out.println(count);


      if(count==n)
      System.out.println("yes");





      class Coordinates
      int x;
      int y;

      Coordinates(int x, int y)
      this.x =x;
      this.y =y;


      public int getX()
      return x;


      public void setX(int x)
      this.x = x;


      public int getY()
      return y;


      public void setY(int y)
      this.y = y;









      java





      share







      New contributor




      Prashant Balotra is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.










      share







      New contributor




      Prashant Balotra is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.








      share



      share






      New contributor




      Prashant Balotra is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      asked 7 mins ago









      Prashant BalotraPrashant Balotra

      1




      1




      New contributor




      Prashant Balotra is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      New contributor





      Prashant Balotra is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      Prashant Balotra is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.




















          0






          active

          oldest

          votes











          Your Answer





          StackExchange.ifUsing("editor", function ()
          return StackExchange.using("mathjaxEditing", function ()
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
          );
          );
          , "mathjax-editing");

          StackExchange.ifUsing("editor", function ()
          StackExchange.using("externalEditor", function ()
          StackExchange.using("snippets", function ()
          StackExchange.snippets.init();
          );
          );
          , "code-snippets");

          StackExchange.ready(function()
          var channelOptions =
          tags: "".split(" "),
          id: "196"
          ;
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function()
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled)
          StackExchange.using("snippets", function()
          createEditor();
          );

          else
          createEditor();

          );

          function createEditor()
          StackExchange.prepareEditor(
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: false,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: null,
          bindNavPrevention: true,
          postfix: "",
          imageUploader:
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          ,
          onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          );



          );






          Prashant Balotra is a new contributor. Be nice, and check out our Code of Conduct.









          draft saved

          draft discarded


















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216387%2fsnake-node-movement-function%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          Prashant Balotra is a new contributor. Be nice, and check out our Code of Conduct.









          draft saved

          draft discarded


















          Prashant Balotra is a new contributor. Be nice, and check out our Code of Conduct.












          Prashant Balotra is a new contributor. Be nice, and check out our Code of Conduct.











          Prashant Balotra is a new contributor. Be nice, and check out our Code of Conduct.














          Thanks for contributing an answer to Code Review Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid


          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.

          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216387%2fsnake-node-movement-function%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          名間水力發電廠 目录 沿革 設施 鄰近設施 註釋 外部連結 导航菜单23°50′10″N 120°42′41″E / 23.83611°N 120.71139°E / 23.83611; 120.7113923°50′10″N 120°42′41″E / 23.83611°N 120.71139°E / 23.83611; 120.71139計畫概要原始内容臺灣第一座BOT 模式開發的水力發電廠-名間水力電廠名間水力發電廠 水利署首件BOT案原始内容《小檔案》名間電廠 首座BOT水力發電廠原始内容名間電廠BOT - 經濟部水利署中區水資源局

          Prove that NP is closed under karp reduction?Space(n) not closed under Karp reductions - what about NTime(n)?Class P is closed under rotation?Prove or disprove that $NL$ is closed under polynomial many-one reductions$mathbfNC_2$ is closed under log-space reductionOn Karp reductionwhen can I know if a class (complexity) is closed under reduction (cook/karp)Check if class $PSPACE$ is closed under polyonomially space reductionIs NPSPACE also closed under polynomial-time reduction and under log-space reduction?Prove PSPACE is closed under complement?Prove PSPACE is closed under union?

          Is my guitar’s action too high? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Strings too stiff on a recently purchased acoustic guitar | Cort AD880CEIs the action of my guitar really high?Μy little finger is too weak to play guitarWith guitar, how long should I give my fingers to strengthen / callous?When playing a fret the guitar sounds mutedPlaying (Barre) chords up the guitar neckI think my guitar strings are wound too tight and I can't play barre chordsF barre chord on an SG guitarHow to find to the right strings of a barre chord by feel?High action on higher fret on my steel acoustic guitar