N进制加法
1. https://blog.csdn.net/zyx_ly/article/details/108956119
https://www.cnblogs.com/lz3018/p/5330531.html
https://blog.csdn.net/JingleLiA/article/details/108577265
约瑟夫问题
2.https://blog.csdn.net/u010889616/article/details/50760423
https://blog.csdn.net/qq_28773183/article/details/77881909
class Solution {
static Scanner in = new Scanner(System.in);
static String addByJinzhi(String a, String b,int jizhi) {
StringBuffer ans = new StringBuffer();
int n = Math.max(a.length(), b.length()), carry = 0;
for (int i = 0; i < n; ++i) {
carry += i < a.length() ? (a.charAt(a.length() - 1 - i) - '0') : 0;
carry += i < b.length() ? (b.charAt(b.length() - 1 - i) - '0') : 0;
ans.append((char) (carry % jizhi + '0'));
carry /= jizhi;
}
if (carry > 0) {
ans.append('1');
}
ans.reverse();
return ans.toString();
}
public static void main(String[] args){
String a = in.next();
String b = in.next();
int jinzhi = in.nextInt();
System.out.println(addByJinzhi(a,b,jinzhi));
}
}
---------------------------------------------------------
1、github排名第一刷题指导
https://github.com/labuladong/fucking-algorithm
2,面试宝典
https://github.com/0voice/interview_internal_reference/blob/master/README.md#1
---------------------------