• 18_08_20 jQuery 获取URL中的参数


    发出请求

    function loadInfoDetails(a, b, c, d, e, f, g) {
    	window.location.href = window.basePath + "ssss/xxxxx/jsp/yyyyy.jsp?a=" + a+ "&b=" + b+ "&c=" + c+ "&d=" + d+ "&e=" + e+ "&f=" + f
    			+ "&g=" + g;
    }
    

    获取并解析

    $(document).ready(function() {
    
                            var url = location.href;
    
    			var id;// 提取URL中的 id
    			var divName;
    			var typeName;
    			var typeDetailName;
    			var ftlURL;
    			var ftlDetailURL;
    
    			var arrStr = url.substring(url.indexOf("?") + 1).split("&");
    			for (var i = 0; i < arrStr.length; i++) {
    				var loc = arrStr[i].indexOf("id=");
    				if (loc != -1) {
    					id = arrStr[i].replace("id=", "").replace("?", "");
    				}
    
    				loc = arrStr[i].indexOf("divName=")
    				if (loc != -1) {
    					divName = arrStr[i].replace("divName=", "");
    				}
    
    				loc = arrStr[i].indexOf("typeName=")
    				if (loc != -1) {
    					typeName = arrStr[i].replace("typeName=", "");
    				}
    
    				loc = arrStr[i].indexOf("typeDetailName=")
    				if (loc != -1) {
    					typeDetailName = arrStr[i].replace("typeDetailName=", "");
    				}
    
    				loc = arrStr[i].indexOf("ftlURL=")
    				if (loc != -1) {
    					ftlURL = arrStr[i].replace("ftlURL=", "");
    				}
    
    				loc = arrStr[i].indexOf("ftlDetailURL=")
    				if (loc != -1) {
    					ftlDetailURL = arrStr[i].replace("ftlDetailURL=", "");
    				}
    			}
    }
    
  • 相关阅读:
    POJ 2251 Dungeon Master
    HDU 3085 Nightmare Ⅱ
    CodeForces 1060 B Maximum Sum of Digits
    HDU 1166 敌兵布阵(树状数组)
    HDOJ 2050 折线分割平面
    HDU 5879 Cure
    HDU 1878 欧拉回路
    HDU 6225 Little Boxes
    ZOJ 2971 Give Me the Number
    HDU 2680 Choose the best route
  • 原文地址:https://www.cnblogs.com/du1991/p/9506249.html
Copyright © 2020-2023  润新知