1102. Invert a Binary Tree (25)

本文介绍了一种翻转二叉树的算法实现,并通过具体的输入输出样例展示了如何使用该算法。文章提供了完整的C++代码,实现了二叉树的创建、层级遍历和中序遍历等功能。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

1102. Invert a Binary Tree (25)
时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B
判题程序 Standard 作者 CHEN, Yue

The following is from Max Howell @twitter:
Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so fuck off.
Now it’s your turn to prove that YOU CAN invert a binary tree!
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (<=10) which is the total number of nodes in the tree – and hence the nodes are numbered from 0 to N-1. Then N lines follow, each corresponds to a node from 0 to N-1, and gives the indices of the left and right children of the node. If the child does not exist, a “-” will be put at the position. Any pair of children are separated by a space.
Output Specification:
For each test case, print in the first line the level-order, and then in the second line the in-order traversal sequences of the inverted tree. There must be exactly one space between any adjacent numbers, and no extra space at the end of the line.
Sample Input:
8
1 -
- -
0 -
2 7
- -
- -
5 -
4 6
Sample Output:
3 7 2 6 4 0 5 1
6 5 7 4 3 2 0 1

#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
#include <string>
#include <vector> 
#include <queue>
#include <sstream>
#include <memory.h>

using namespace std;
const int MaxN = 12;
int Num[MaxN],N,P = 0,L = 0;
bool isRoot[MaxN];

typedef struct tnode
{
    int data;
    struct tnode * lchild;
    struct tnode * rchild;
}TNode;
TNode *Ptr[MaxN];


void Level(TNode * root)
{
    if (!root) return;

    queue<TNode *>que; que.push(root);
    while (que.size())
    {
        TNode * node = que.front(); que.pop();
        ++L;
        cout << node->data;
        if (L != N)
            cout << " ";

        if (node->rchild) que.push(node->rchild);
        if (node->lchild) que.push(node->lchild);
    }

}


void InOrder(TNode * root)
{
    if (!root)return;

    InOrder(root->rchild);

    cout << root->data; ++P;
    if (P != N)
        cout << " ";

    InOrder(root->lchild);

    delete root;
}

TNode * CreateTree(int N)
{
    for (int i = 0; i < N; ++i)
    {
        Ptr[i] = new TNode;
        Ptr[i]->data = i;
        Ptr[i]->lchild = Ptr[i]->rchild = NULL;
    }

    stringstream ss; string str;
    for (int i = 0; i < N; ++i)
    {
        getline(cin, str);
        ss << str;
        int k = 0;
        if (str[k] == '-')
        {
            Ptr[i]->lchild = NULL;
            ss.get();
            ss.get();
        }
        else
        {
            int lidx;
            ss >> lidx;
            Ptr[i]->lchild = Ptr[lidx];
            isRoot[lidx] = false;
        }

        while (str[k] != ' ')
            ++k;

        if (str[k+1] == '-')
        {
            Ptr[i]->rchild = NULL;
        }
        else
        {
            int ridx;
            ss >> ridx;
            Ptr[i]->rchild = Ptr[ridx];
            isRoot[ridx] = false;
        }

        ss.clear();
        ss.str("");

    }

    TNode * root = NULL;
    for (int i = 0; i < N; ++i)
    {
        if (isRoot[i])
        {
            root = Ptr[i];
            break;
        }
    }
    return root;
}
int main()
{
#ifdef _DEBUG
    freopen("data.txt", "r+", stdin);
#endif

    std::ios::sync_with_stdio(false);

    memset(isRoot, 1, sizeof(isRoot));
    cin >> N; cin.get();

    TNode * root = CreateTree(N);

    Level(root); cout << endl;
    InOrder(root);


    return 0;
}
import cv2 import numpy as np def is_approx_rect(contour, epsilon_factor=0.02): peri = cv2.arcLength(contour, True) approx = cv2.approxPolyDP(contour, epsilon_factor * peri, True) return (4 <= len(approx) <= 5 and cv2.isContourConvex(approx)), approx def calc_center(approx): M = cv2.moments(approx) if M["m00"] == 0: return None return int(M["m10"] / M["m00"]), int(M["m01"] / M["m00"]) def distance(p1, p2): return np.sqrt((p1[0]-p2[0])**2 + (p1[1]-p2[1])**2) def main(): cap = cv2.VideoCapture("222.mp4") if not cap.isOpened(): print("打开视频失败") return prev_center = None while True: ret, frame = cap.read() if not ret: break gray = cv2.cvtColor(frame, cv2.COLOR_BGR2GRAY) _, binary = cv2.threshold(gray, 120, 255, cv2.THRESH_BINARY_INV) closed = cv2.morphologyEx(binary, cv2.MORPH_CLOSE, cv2.getStructuringElement(cv2.MORPH_RECT, (50, 50))) contours_data = cv2.findContours(closed, cv2.RETR_TREE, cv2.CHAIN_APPROX_SIMPLE) contours = contours_data[1] if len(contours_data) == 3 else contours_data[0] candidates = [] for cnt in contours: is_rect, approx = is_approx_rect(cnt) if is_rect: center = calc_center(approx) if center: candidates.append((approx, center, cv2.contourArea(approx))) if not candidates: selected = None elif prev_center is None: selected = max(candidates, key=lambda x: x[2]) else: candidates.sort(key=lambda x: distance(x[1], prev_center)) top_n = [candidates[0]] for c in candidates[1:]: if distance(c[1], prev_center) - distance(candidates[0][1], prev_center) < 50: top_n.append(c) else: break selected = max(top_n, key=lambda x: x[2]) display_frame 将上述代码改成适用于 openmv4 h7 plus 的代码要求给出完整代码
最新发布
08-03
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值