POJ 刷题系列:1503 Integer Inquiry

POJ 刷题系列:1503 Integer Inquiry

传送门:POJ 1503 Integer Inquiry

题意:

实现VeryLongIntegers两数相加算法。

思路: 因为字符长度可达100位,自然不能用long,int这些基本类型实现。所以采用字符串逐个相加进位来实现,熟悉进位法即可。

代码如下:

import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Map;
import java.util.StringTokenizer;

public class Main{

    String INPUT = "./data/judge/201712/P1503.txt";

    public static void main(String[] args) throws IOException {
        new Main().run();
    }

    String add(String s1, String s2) {
        char[] num1 = s1.toCharArray();
        char[] num2 = s2.toCharArray();

        int n1 = num1.length;
        int n2 = num2.length;

        int maxLen = Math.max(n1, n2);
        StringBuilder sb = new StringBuilder();
        int rem = 0;
        for (int i = 1; i <= maxLen; ++i) {
            int digit1 = n1 - i < 0 ? 0 : num1[n1 - i] - '0';
            int digit2 = n2 - i < 0 ? 0 : num2[n2 - i] - '0';
            int sum = digit1 + digit2 + rem;
            rem = sum / 10;
            sb.append(sum % 10);
        }
        if (rem != 0) sb.append(rem);
        return sb.reverse().toString();
    }

    void read() {
        String ans = "0";
        while (true) {
            String num = ns();
            if (num.equals("0")) break;
            ans = add(num, ans);
        }
        out.println(ans);
    }

    FastScanner in;
    PrintWriter out;

    void run() throws IOException {
        boolean oj;
        try {
            oj = ! System.getProperty("user.dir").equals("F:\\oxygen_workspace\\Algorithm");
        } catch (Exception e) {
            oj = System.getProperty("ONLINE_JUDGE") != null;
        }

        InputStream is = oj ? System.in : new FileInputStream(new File(INPUT));
        in = new FastScanner(is);
        out = new PrintWriter(System.out);
        long s = System.currentTimeMillis();
        read();
        out.flush();
        if (!oj){
            System.out.println("[" + (System.currentTimeMillis() - s) + "ms]");
        }
    }

    public boolean more(){
        return in.hasNext();
    }

    public int ni(){
        return in.nextInt();
    }

    public long nl(){
        return in.nextLong();
    }

    public double nd(){
        return in.nextDouble();
    }

    public String ns(){
        return in.nextString();
    }

    public char nc(){
        return in.nextChar();
    }

    class FastScanner {
        BufferedReader br;
        StringTokenizer st;
        boolean hasNext;

        public FastScanner(InputStream is) throws IOException {
            br = new BufferedReader(new InputStreamReader(is));
            hasNext = true;
        }

        public String nextToken() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                    hasNext = false;
                    return "##";
                }
            }
            return st.nextToken();
        }

        String next = null;
        public boolean hasNext(){
            next = nextToken();
            return hasNext;
        }

        public int nextInt() {
            if (next == null){
                hasNext();
            }
            String more = next;
            next = null;
            return Integer.parseInt(more);
        }

        public long nextLong() {
            if (next == null){
                hasNext();
            }
            String more = next;
            next = null;
            return Long.parseLong(more);
        }

        public double nextDouble() {
            if (next == null){
                hasNext();
            }
            String more = next;
            next = null;
            return Double.parseDouble(more);
        }

        public String nextString(){
            if (next == null){
                hasNext();
            }
            String more = next;
            next = null;
            return more;
        }

        public char nextChar(){
            if (next == null){
                hasNext();
            }
            String more = next;
            next = null;
            return more.charAt(0);
        }
    }

    static class D{

        public static void pp(int[][] board, int row, int col) {
            StringBuilder sb = new StringBuilder();
            for (int i = 0; i < row; ++i) {
                for (int j = 0; j < col; ++j) {
                    sb.append(board[i][j] + (j + 1 == col ? "\n" : " "));
                }
            }
            System.out.println(sb.toString());
        }

        public static void pp(char[][] board, int row, int col) {
            StringBuilder sb = new StringBuilder();
            for (int i = 0; i < row; ++i) {
                for (int j = 0; j < col; ++j) {
                    sb.append(board[i][j] + (j + 1 == col ? "\n" : " "));
                }
            }
            System.out.println(sb.toString());
        }
    }

    static class ArrayUtils {

        public static void fill(int[][] f, int value) {
            for (int i = 0; i < f.length; ++i) {
                Arrays.fill(f[i], value);
            }
        }

        public static void fill(int[][][] f, int value) {
            for (int i = 0; i < f.length; ++i) {
                fill(f[i], value);
            }
        }

        public static void fill(int[][][][] f, int value) {
            for (int i = 0; i < f.length; ++i) {
                fill(f[i], value);
            }
        }
    }

    static class Num{
        public static <K> void inc(Map<K, Integer> mem, K k) {
            if (!mem.containsKey(k)) mem.put(k, 0);
            mem.put(k, mem.get(k) + 1);
        }
    }
}

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

相关文章

来自专栏机器学习入门

LWC 62:745. Prefix and Suffix Search

LWC 62:745. Prefix and Suffix Search 传送门:745. Prefix and Suffix Search Problem: ...

1986
来自专栏一枝花算不算浪漫

Java中常见数据结构Set之HashSet

2876
来自专栏菩提树下的杨过

Spring Security笔记:登录尝试次数限制

今天在前面一节的基础之上,再增加一点新内容,默认情况下Spring Security不会对登录错误的尝试次数做限制,也就是说允许暴力尝试,这显然不够安全,下面的...

3165
来自专栏码匠的流水账

聊聊storm的WindowedBoltExecutor

storm-2.0.0/storm-client/src/jvm/org/apache/storm/topology/WindowedBoltExecutor....

732
来自专栏编码小白

ofbiz实体引擎(八) 创建表

/** * @author 郑小康 * * 1.检验实体是否为空 * * 2.检验视图实体是否为空 ...

2583
来自专栏积累沉淀

15分钟熟悉HBase Shell命令

下面我们看看HBase Shell的一些基本操作命令,我列出了几个常用的HBase Shell命令,如下: 名称 命令表达式 创建表 ...

1808
来自专栏码匠的流水账

聊聊sentinel的StatisticSlot

com/alibaba/csp/sentinel/slots/statistic/StatisticSlot.java

532
来自专栏机器学习入门

LWC 57:721. Accounts Merge

LWC 57:721. Accounts Merge 传送门:721. Accounts Merge Problem: Given a list accoun...

1849
来自专栏数据处理

WordsCount

1667
来自专栏xingoo, 一个梦想做发明家的程序员

Hbase常用Shell命令

status 查看系统状态 hbase(main):010:0> status 1 active master, 0 backup masters, 4 ser...

1965

扫码关注云+社区