等式方程的可满足性
class Solution {public:int find(vectorint father,int x){if(father[x]!x)father[x] find(father,father[x]);//如果father[x]不是源头继续往前找return father[x];}void un(vectorint father,int x,int y){father[find(father,x)]find(father,y);//y的源头等于x的源头}bool equationsPossible(vectorstring equations) {int res0;int nequations.size(),mequations[0].size();vectorintfather(261,-1);for(int i0;i26;i){father[i]i;}for(int i0;in;i){int ch1equations[i][0]-a;int ch2equations[i][3]-a;string opequations[i].substr(1,2);if(op)un(father,ch1,ch2);}for(int i0;in;i){int ch1equations[i][0]-a;int ch2equations[i][3]-a;char opequations[i][1];if(op!){if(find(father,ch1)find(father,ch2))return false;}}return true;}};
本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如若转载,请注明出处:http://www.coloradmin.cn/o/2466798.html
如若内容造成侵权/违法违规/事实不符,请联系多彩编程网进行投诉反馈,一经查实,立即删除!