project Euler problem 8

import java.util.ArrayList;

    /**
     * Created by Administrator on 2015/5/9.
     */
    public class E8 {
        public static void main(String[] args) {

            String number=new String("73167176531330624919225119674426574742355349194934"+
                    "96983520312774506326239578318016984801869478851843"+
                    "85861560789112949495459501737958331952853208805511"+
                    "12540698747158523863050715693290963295227443043557"+
                    "66896648950445244523161731856403098711121722383113"+
                    "62229893423380308135336276614282806444486645238749"+
                    "30358907296290491560440772390713810515859307960866"+
                    "70172427121883998797908792274921901699720888093776"+
                    "65727333001053367881220235421809751254540594752243"+
                    "52584907711670556013604839586446706324415722155397"+
                    "53697817977846174064955149290862569321978468622482"+
                    "83972241375657056057490261407972968652414535100474"+
                    "82166370484403199890008895243450658541227588666881"+
                    "16427171479924442928230863465674813919123162824586"+
                    "17866458359124566529476545682848912883142607690042"+
                    "24219022671055626321111109370544217506941658960408"+
                    "07198403850962455444362981230987879927244284909188"+
                    "84580156166097919133875499200524063689912560717606"+
                    "05886116467109405077541002256983155200055935729725"+
                    "71636269561882670428252483600823257530420752963450");
            ArrayList<Integer> arrayList=new ArrayList<Integer>();
            long max=0;
            int length=number.length();
            for(int i=0;i<length-13;i++)
            {
                long tempmax=1;//注意一定要设置成long,否则会越界,调试了好久,菜鸟
                for(int count=i;count<i+13;count++)//每次取13个数
                {
                    arrayList.add(Integer.parseInt(number.substring(count,count+1)));//注意每次取值初始角标的变化。
                }
                for(Integer integer:arrayList)
                {
                    tempmax *=integer;
                }
                if(tempmax>max)
                    max=tempmax;
                arrayList.clear();//注意一定要给arraylist 清零
            }
            System.out.println(max);
        }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
openEuler-k8s是指在openEuler操作系统上部署Kubernetes集群的过程。根据引用\[1\]中提到的官方文档,openEuler官方文档部署K8s集群比较复杂,并且网上相关资料较少。因此,可以参考引用\[1\]中提供的文章,通过实践与测试整理的openEuler 22.03部署Kubernetes 1.20.2集群操作方法来进行部署。在安装准备阶段,可以参考引用\[2\]中的容器镜像列表,选择适合的容器镜像。同时,还可以参考引用\[3\]中的虚拟机镜像列表,选择适合的虚拟机镜像。需要注意的是,这篇文章仅供学习参考,请勿直接用于生产环境。 #### 引用[.reference_title] - *1* [openEuler 部署Kubernetes(K8s)集群](https://blog.csdn.net/BY_imba/article/details/128490582)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v91^control_2,239^v3^insert_chatgpt"}} ] [.reference_item] - *2* *3* [从0到1一步一步玩转openEuler--01 openEuler操作系统介绍](https://blog.csdn.net/shuchaoyang/article/details/128857128)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v91^control_2,239^v3^insert_chatgpt"}} ] [.reference_item] [ .reference_list ]
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值