Created
November 7, 2014 11:08
-
-
Save LittleHelicase/fbaaafc1d944c95cdd6b to your computer and use it in GitHub Desktop.
Stack Sentence Beispiel // source http://jsbin.com/votehocalu
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| <!DOCTYPE html> | |
| <html> | |
| <head> | |
| <meta charset="utf-8"> | |
| <title>Stack Sentence Beispiel</title> | |
| <!-- der Stack wird über die ArrayList implementiert --> | |
| <script src="http://jsbin.com/cuqure.js"></script> | |
| <!-- Implementierung des Stacks als ArrayStack --> | |
| <script src="http://jsbin.com/zucuze.js"></script> | |
| </head> | |
| <body> | |
| <script id="jsbin-javascript"> | |
| function reverse(stack, character){ | |
| if(character == " "){ | |
| var res = ""; | |
| while(!stack.empty()){ | |
| res += stack.pop(); | |
| } | |
| res += " "; | |
| return res; | |
| } else { | |
| stack.push(character); | |
| return ""; | |
| } | |
| } | |
| function reverseSentence(s){ | |
| var n = s.length; | |
| var stack = new ArrayStack(); | |
| stack.create(); | |
| var res = ""; | |
| for(var i=0; i<n; i++){ | |
| res += reverse(stack, s[i]); | |
| } | |
| while(!stack.empty()){ | |
| res += stack.pop(); | |
| } | |
| return res; | |
| } | |
| console.log(reverseSentence("dreh um")); | |
| </script> | |
| <script id="jsbin-source-javascript" type="text/javascript"> | |
| function reverse(stack, character){ | |
| if(character == " "){ | |
| var res = ""; | |
| while(!stack.empty()){ | |
| res += stack.pop(); | |
| } | |
| res += " "; | |
| return res; | |
| } else { | |
| stack.push(character); | |
| return ""; | |
| } | |
| } | |
| function reverseSentence(s){ | |
| var n = s.length; | |
| var stack = new ArrayStack(); | |
| stack.create(); | |
| var res = ""; | |
| for(var i=0; i<n; i++){ | |
| res += reverse(stack, s[i]); | |
| } | |
| while(!stack.empty()){ | |
| res += stack.pop(); | |
| } | |
| return res; | |
| } | |
| console.log(reverseSentence("dreh um")); | |
| </script></body> | |
| </html> |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function reverse(stack, character){ | |
| if(character == " "){ | |
| var res = ""; | |
| while(!stack.empty()){ | |
| res += stack.pop(); | |
| } | |
| res += " "; | |
| return res; | |
| } else { | |
| stack.push(character); | |
| return ""; | |
| } | |
| } | |
| function reverseSentence(s){ | |
| var n = s.length; | |
| var stack = new ArrayStack(); | |
| stack.create(); | |
| var res = ""; | |
| for(var i=0; i<n; i++){ | |
| res += reverse(stack, s[i]); | |
| } | |
| while(!stack.empty()){ | |
| res += stack.pop(); | |
| } | |
| return res; | |
| } | |
| console.log(reverseSentence("dreh um")); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment