子序列求和最大值之javascript實現

來源:互聯網
上載者:User

 

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> 

<html xmlns="http://www.w3.org/1999/xhtml"> 

<head> 

<meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> 

<title>無標題文檔</title> 

</head> 

 

<body> 

<script type="text/javascript"> 

var list = [4,2,1,-2,10,90,40,-93,-1,8,70]; 

function subSeqMax(a){ 

       var tempMax =0; 

       var currMax =0; 

       for(var i=0;i<a.length;i++){ 

           for(var j=i;j<a.length;j++){ 

               tempMax =addTo(i,j,a); 

               if(tempMax>currMax){ 

                   currMax = tempMax; 

               } 

           } 

       } 

       return currMax; 

 

function addTo(start,end,a){ 

    var tempMax =0; 

    var currMax =0; 

    while(start<=end){ 

        tempMax +=a[start++]; 

        if(tempMax>currMax){ 

            currMax = tempMax;//如果比儲存的值大,就重新整理之; 

        } 

    } 

    return currMax; 

 

alert(subSeqMax(list)); 

//addTo(0,list.length-1,list) 

</script> 

</body> 

</html>   

 

摘自 用文字記錄生命

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.