1 | static int lCommonSuffix(S a, S b) { |
2 | int i = 0; |
3 | while (i < a.length() && i < b.length() && a.charAt(a.length()-1-i) == b.charAt(b.length()-1-i)) |
4 | ++i; |
5 | ret i; |
6 | } |
Began life as a copy of #2000379
download show line numbers debug dex old transpilations
Travelled to 13 computer(s): aoiabmzegqzx, bhatertpkbcr, cbybwowwnfue, cfunsshuasjs, gwrvuhgaqvyk, ishqpsrjomds, lpdgvwnxivlt, mqqgnosmbjvj, pyentgdyhuwx, pzhvpgtvlbxg, tslmcundralx, tvejysmllsmz, vouqrxazstgt
No comments. add comment
Snippet ID: | #1006439 |
Snippet name: | lCommonSuffix |
Eternal ID of this version: | #1006439/1 |
Text MD5: | 50f146d8dcf5e8cf69584f0474818c67 |
Author: | stefan |
Category: | javax |
Type: | JavaX fragment (include) |
Public (visible to everyone): | Yes |
Archived (hidden from active list): | No |
Created/modified: | 2017-01-03 15:29:46 |
Source code size: | 175 bytes / 6 lines |
Pitched / IR pitched: | No / No |
Views / Downloads: | 520 / 526 |
Referenced in: | [show references] |