10 2020 档案
摘要:写了48行才实现,感觉自己好蠢[],又找不到别的实现方法 function out = find_palindrome(y) a(1)=fix(y/100); z=y-100*a(1); a(2)=fix(z/10); a(3)=mod(z,10); frag=false; e=zeros(1,10
阅读全文
摘要:cody challenge Problem 96. Knight's Tour Checker 代码分享 function tf = knights_tour(a) m=length(a(:,1)); n=length(a(1,:)); c=max(max(a)); tf=true; for b=
阅读全文