zoukankan      html  css  js  c++  java
  • 红包金额随机数的生成

     <form>
    红包个数:<input type="text" name="count" id="count" required style="height: 20px;"> <br>
    总金额(元):<input type="text" name="amount" id="amount" required style="height: 20px;"><br>
    <input type="button" id="submit" value="获取红包金额">
    </form></p>
    
    <div id='result'></div>
    
    <script src="https://www.lijinma.com/javascripts/libs/jquery.min.js"></script>
    <script>
    
    $('#submit').click(function(){
      function getRandomInt(min, max) {
        return Math.floor(Math.random() * (max - min)) + min;
      }
    
      function getNextItemKey(currentKey, count) {
        if (currentKey > count) {
          throw 'Error: currentKey > count';
        }
        if (currentKey != count) {
          return currentKey + 1;
        } else {
          return 1;
        }
      }
      
      var count = $('#count').val();
      var amount = $('#amount').val();
      if (!count) {
        alert('红包个数必须填写');
        return false;
      }
      if (!amount) {
        alert('总金额必须填写');
        return false;
      }
      if (amount / count < 0.01) {
        alert('单个红包金额不可低于0.01元,请重新填写金额');
        return false;
      }
      amount = amount * 100;
      var items = [];
      for (var i = 0; i < count; ++ i) {
        items[i] = getRandomInt(1, 100);
      }
      var itemAmounts = [];
      var sum = items.reduce(function(pv, cv) { return pv + cv; }, 0);
      var currentAmount = 0;
      for (var i = 0; i < count; ++ i) {
        if (i !== count - 1) {
          itemAmounts[i] = Math.floor(items[i] / sum * amount);
          currentAmount += itemAmounts[i];
        } else {
          itemAmounts[i] = amount - currentAmount
        }
      }
      
      for (var i = 0; i < count; ++ i ) {
        if (itemAmounts[i] > 0) {
          continue;
        }
        var nextKey = getNextItemKey(i, count);
        var diff = 1 - itemAmounts[i];
        itemAmounts[i] = 1;
        itemAmounts[nextKey] -= diff;
      }
      
      for (var i = 0; i < count; ++ i ) {
        itemAmounts[i] = itemAmounts[i] / 100;
      }
      
      alert(itemAmounts.join('')+'');
      
    });
    </script>
  • 相关阅读:
    网络编程学习笔记(二)基于TCP的Socket编程
    网络编程学习笔记(一)网络基础知识
    Java IO学习笔记(五)对象流
    Java IO学习笔记(四)打印流
    Java IO学习笔记(三)转换流、数据流、字节数组流
    Java IO学习笔记(二)缓冲流
    Java IO学习笔记(一)
    服务提供者框架
    超简单——自己搭建ftp服务器
    简单的排序算法实现
  • 原文地址:https://www.cnblogs.com/dwb91/p/7156777.html
Copyright © 2011-2022 走看看