how can i check if n2 is a sub number of n1? (HW qst.)

1 次查看（过去 30 天）

显示更早的评论

Zaza 2013-1-4

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/57972-how-can-i-check-if-n2-is-a-sub-number-of-n1-hw-qst

采纳的回答： Sean de Wolski

for ex.:

n1 = 123; n2 = 12; (n1>=n2)

n2 is a sub number of n1

i can't make any use of strings or arrays

7 个评论
显示 5更早的评论隐藏 5更早的评论

Azzi Abdelmalek 2013-1-4

The highest power of 10 correspond to 1 not 5

Azzi Abdelmalek 2013-1-4

编辑：Azzi Abdelmalek 2013-1-4

在 MATLAB Online 中打开

check this

2345-fix(2345/10^3)*10^3

then

345-fix(345/10^2)*10^2

and so on

请先登录，再进行评论。

请先登录，再回答此问题。

采纳的回答

Sean de Wolski 2013-1-4

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/57972-how-can-i-check-if-n2-is-a-sub-number-of-n1-hw-qst#answer_70155

在 MATLAB Online 中打开

Here is a hint:

a = 131245;
b = 12;
op = @(x)hidden_for_you_to_figure_out(x);
pa = op(a);
pb = op(b);
isASub = false; %guilty until proven innocent
for ii = pb:pa
  amii = mod(a,(10^ii));
  if amii == b
      isASub = true;
      return;
  else
      for jj = 1:(ii-pb)            
          afjj = floor(amii./(10^jj));            
          if b == afjj
              isASub = true;
              return;
          end
      end
  end
end

All you have to do it figure out the contents of op().

1 个评论
显示 -1更早的评论隐藏 -1更早的评论

Zaza 2013-1-6

编辑：Zaza 2013-1-6

op() == num_of_digits() ???

请先登录，再进行评论。

更多回答（2 个）

Azzi Abdelmalek 2013-1-4

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/57972-how-can-i-check-if-n2-is-a-sub-number-of-n1-hw-qst#answer_70152

编辑：Azzi Abdelmalek 2013-1-4

在 MATLAB Online 中打开

n1=12456;
n2=245
a=num2str(n1);
b=num2str(n2);
c=all(ismember(b,a))

if c is equal to 1 that means n2 is a sub number of n1

6 个评论
显示 4更早的评论隐藏 4更早的评论

Zaza 2013-1-4

can i use floor instead of fix?

Azzi Abdelmalek 2013-1-4

Yes you can

请先登录，再进行评论。

Walter Roberson 2013-1-4

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/57972-how-can-i-check-if-n2-is-a-sub-number-of-n1-hw-qst#answer_70167

Create a function that calculates the decimal expansion of a number in reverse order. mod() 10 gives the next digit to be output, integer division by 10, if the result is non-zero keep going.

Apply that to both numbers.

Now match the reversed n2 to the reversed n1.