stack

I'm looking for a way to dump the stack of my arduino. I know there is a stack pointer (SP) available, what I try at the moment is: char* stack = (char*)SP; int counter = 0; strncpy(c, &stack[counter], 1); while(counter < 200) { counter++; strncat(c, &stack[counter], 1); } Serial.print(c); I don't get anything like a stack so I don't know if I'm doing it right. Please help! uint8_t stackArray[30]; void createStackDump() { volatile uint8_t* mSP = (uint8_t*)SP; for (int i = 0; i < 30; i++) { stackArray[i] = *mSP; mSP++; } } Call addresses on the stack are LSB first, so LSB has the higher stack

栈应用的场景： 1.括号问题 2.后缀表达式 3.深度优先遍历 4.保存现场 1. 给定字符串，仅由“()[]{}”六个字符组成。设计算法，判断该字符串是否有效。 括号必须以正确的顺序配对，如“()”、“()[]{}”是有效的，但 " ([)]"是无效的( Leetcode 20 )。 思想就是碰到左括号压栈，右括号出栈，然后判断弹出的元素是不是一对，最后栈为空则是真的。 代码如下： public class Solution { public boolean isValid(String s) { Stack<Character> stack = new Stack<Character>(); boolean isvalid = true; char[] c = s.toCharArray(); char temp; for (int i = 0; i < c.length; i++) { switch (c[i]) { case '(': stack.push(c[i]); break; case ')': if(stack.isEmpty()) { isvalid = false; }else { temp = stack.pop(); if (temp != '(') { isvalid = false; } } break; case '[': stack.push(c

void gctinp (char *inp, int siz) { puts ("Input value: "); fgets (inp, siz, stdin); printf ("buffer3 getinp read %s", inp); } From what I've read, fgets is supposed to be used when you want to limit the size of input. So this code shouldn't be vulnerable right? It is being called like so: int main (int argc, char *argv[]) { char buf[16]; getinp (buf, sizeof (buf)); display (buf); printf ("buffer3 done\n"); } Thanks for your time. You won't strike buffer overflow problems if you enter more characters than can be safely stored since fgets restricts the input. It also adds a null terminator