uva_112_Tree Summing

最新推荐文章于 2019-02-23 22:18:43 发布

unixcsir

最新推荐文章于 2019-02-23 22:18:43 发布

阅读量272

点赞数

分类专栏： Tree

本文链接：https://blog.csdn.net/unixcsir/article/details/8152923

版权

Tree 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

#include <cstdio>
#include <cctype>
#include <cstring>
#include <algorithm>
using namespace std;

#define MAXN    1001

typedef struct _BTREENODE {
        int data;
        struct _BTREENODE *left_child;
        struct _BTREENODE *right_child;
}BTREENODE;

char ch, num[MAXN/100];
int stack[MAXN], s_pos, flag;

void get_node_data(BTREENODE **node)
{
        if( !s_pos ) {
                (*node) = NULL; return;
        }
        int idx(0), mark(0), val;
        while( ~scanf("%c", &ch) && s_pos ) {
                if( '(' == ch ) {
                        stack[s_pos ++] = ch; mark ++;
                }
                else if( ')' == ch ) {
                        s_pos --;
                }
                else if( '-' == ch || isdigit(ch) ) {
                        num[idx ++] = ch;
                }
                if( mark ) {
                        if( idx ) {
                                num[idx] = '\0'; sscanf(num, "%d", &val);
                        }
                        break;
                }
        }
        if( !idx ) {
                (*node) = NULL; return;
        }
        (*node) = new BTREENODE; (*node)->data = val;
        get_node_data(&(*node)->left_child);  get_node_data(&(*node)->right_child);
}

void pre_order(BTREENODE *node, int cur_sum, const int &search_key)
{
        if( NULL == node || flag ) {
                return;
        }
        if( NULL == node->left_child && NULL == node->right_child && 
            cur_sum+node->data == search_key ) {
                flag = 1; return;
        }
        pre_order(node->left_child, cur_sum+node->data, search_key);
        pre_order(node->right_child, cur_sum+node->data, search_key);
}

int main(int argc, char const *argv[])
{
#ifndef ONLINE_JUDGE
        freopen("test.in", "r", stdin);
#endif
        int search_key;
        BTREENODE *root;
        while( ~scanf("%d", &search_key) ) {
                while( scanf("%c", &ch) && '(' != ch ) {}
                s_pos = 0; stack[s_pos ++] = ch; flag = 0;
                get_node_data(&root); pre_order(root, 0, search_key);
                if( flag ) {
                        printf("yes\n"); continue;
                }
                printf("no\n");
        }
        return 0;
}