Snake node movement function
$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;
}
}
java
asked 7 mins ago
Prashant BalotraPrashant Balotra
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.
$endgroup$
add a comment |
$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;
}
}
java
asked 7 mins ago
Prashant BalotraPrashant Balotra
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.
$endgroup$
add a comment |
$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;
}
}
java
asked 7 mins ago
Prashant BalotraPrashant Balotra
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.
$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
java
asked 7 mins ago
Prashant BalotraPrashant Balotra
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.
asked 7 mins ago
Prashant BalotraPrashant Balotra
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.
asked 7 mins ago
Prashant BalotraPrashant Balotra
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.
asked 7 mins ago
Prashant BalotraPrashant Balotra
1
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.
add a comment |
add a comment |
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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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.
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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
