微信开发之微信分享 node.js直接使用、C#、 java 通用

/**
 * 微信分享
 */
$(function(){
    if (browser.versions.mobile) {//判断是否是移动设备打开。browser代码在下面
        var ua = navigator.userAgent.toLowerCase();//获取判断用的对象
        if (ua.match(/MicroMessenger/i) == "micromessenger") {
            //在微信中打开
            getwxconfig();
            var linkurl = "https://mp.weixin.qq.com/s?__biz=MzA4MTI5OTYxMw==&mid=503676494&idx=2&sn=8a872ed1e937f78e2beb5d2a6c81edec&scene=1&srcid=0617k5ZsRGm33vu7tv2V5BMn&from=singlemessage&isappinstalled=0";
            var title = "晒绿植领泰笛花瓶";
            var des = "泰笛老板太任性,10000个花瓶免费送";
            var imgurl = "https://m.24tidy.com/activity/SmileyFace/img/wxshare.png";
            wxshare(linkurl,title,des,imgurl);
        }else{
        }
    } else {
        //否则就是PC浏览器打开
    }
});

//获取微信配置信息
function getwxconfig() {
    var url = location.href.split('#')[0];
          $.ajax({
                type: "POST",
                url: "/ceo_data/weixintoken",
                data: {
                    'action': 'wxApi',
                    'url': url
                },
                dataType: "json",
                async: false,
                success: function (data) {
                    //console.log('配置成功');
                    wx.config({
                        debug: false,
                        appId: data.appId,
                        timestamp: data.timestamp,
                        nonceStr: data.nonceStr,
                        signature: data.signature,
                        jsApiList: [
                            // 所有要调用的 API 都要加到这个列表中
                            'onMenuShareAppMessage',
                            'onMenuShareTimeline',
                            'onMenuShareQQ',
                            'onMenuShareWeibo',
                            'onMenuShareQZone',
                            'chooseImage',//选择照片或者拍照
                            'uploadImage'//上传图片
                        ]
                    });
                },
                error: function (data) {
                    console.log('分享配置失败');
                }
            });
}
//微信分享
function wxshare(linkurl,title,des,imgurl) {
    wx.ready(function () {
        //微信分享
        wx.onMenuShareTimeline({
            title: title, // 分享标题
            desc: des, // 分享描述
            link: linkurl, // 分享链接
            imgUrl: imgurl, // 分享图标
            success: function () {
                // 用户确认分享后执行的回调函数
                //alert("成功");
            },
            cancel: function () {
                // 用户取消分享后执行的回调函数
                //alert("失败");
            }
        });
        wx.onMenuShareAppMessage({
            title: title, // 分享标题
            desc: des, // 分享描述
            link: linkurl, // 分享链接
            imgUrl: imgurl, // 分享图标
            type: '', // 分享类型,music、video或link,不填默认为link
            dataUrl: '', // 如果type是music或video,则要提供数据链接,默认为空
            success: function () {
                // 用户确认分享后执行的回调函数
                //alert("成功");
            },
            cancel: function () {
                // 用户取消分享后执行的回调函数
                //alert("失败");
            }
        });
        wx.onMenuShareQQ({
            title: title, // 分享标题
            desc: des, // 分享描述
            link: linkurl, // 分享链接
            imgUrl: imgurl, // 分享图标
            success: function () {
                // 用户确认分享后执行的回调函数
            },
            cancel: function () {
                // 用户取消分享后执行的回调函数
            }
        });
        wx.onMenuShareWeibo({
            title: title, // 分享标题
            desc: des, // 分享描述
            link: linkurl, // 分享链接
            imgUrl: imgurl, // 分享图标
            success: function (res) {

            },
            cancel: function (res) {

            },
            fail: function (res) {

            }
        });
        wx.onMenuShareQZone({
            title: title, // 分享标题
            desc: des, // 分享描述
            link: linkurl, // 分享链接
            imgUrl: imgurl, // 分享图标
            success: function (res) {

            },
            cancel: function (res) {

            },
            fail: function (res) {

            }
        });
    });
}

后端代码
AJAX获取 我这是node.js,看注释node.js 、C#、 java 通用



exports.weixintoken = function (req, res, next){
    async.waterfall([
        function (cb){
            http.get( 'http://10.1.4.60:8070/weixin/access_token', function(res1) { res1.setEncoding('utf8');
                res1.on('data', function (data) {
                    var datajosn=eval('('+data+')')
                    cb(null,datajosn["access_token"]);
                });
            });

        },function(access_token,cb){
            var appId ="wxaab9f995020c60b0";
            var access_token =access_token;
            var timestamp=   Math.round(new Date().getTime()/1000);
            var noncestr ="zhongyuan";
            var ticket ="";
            var url = req.body.url;
            console.log(access_token+"1234")
            http.get( 'http://api.weixin.qq.com/cgi-bin/ticket/getticket?access_token='+access_token+'&type=jsapi', function(res2) { res2.setEncoding('utf8');
                res2.on('data', function (data) {
                    var datajosn=eval('('+data+')')

                    console.log(datajosn["ticket"]);
                    ticket=datajosn["ticket"];
                    var jsapi_ticket="jsapi_ticket="+ticket+"&noncestr="+noncestr+"&timestamp="+timestamp+"&url="+url+"";
                    res.json({appId:appId,access_token:access_token,timestamp:timestamp,nonceStr:noncestr,signature: hex_sha1(jsapi_ticket)});
                });
            });
        }
    ])


}


}

思路就是首先要知道access_token,然后通过access_token
get请求http://api.weixin.qq.com/cgi-bin/ticket/getticket?access_token=‘+access_token+’&type=jsapi

获取jsapi_ticket,然后进行hex_sha1加密

然后将appId、timestamp(当前时间戳)
、noncestr(签名随机串自定义)
加密后的jsapi_ticket传到前台

{appId:appId,access_token:access_token,timestamp:timestamp,nonceStr:noncestr,signature: hex_sha1(jsapi_ticket)}

下面是js加密方法

/*
 * These are the functions you'll usually want to call
 * They take string arguments and return either hex or base-64 encoded strings
 */
function hex_sha1(s) {
    return binb2hex(core_sha1(str2binb(s), s.length * chrsz));
}
function b64_sha1(s) {
    return binb2b64(core_sha1(str2binb(s), s.length * chrsz));
}
function str_sha1(s) {
    return binb2str(core_sha1(str2binb(s), s.length * chrsz));
}
function hex_hmac_sha1(key, data) {
    return binb2hex(core_hmac_sha1(key, data));
}
function b64_hmac_sha1(key, data) {
    return binb2b64(core_hmac_sha1(key, data));
}
function str_hmac_sha1(key, data) {
    return binb2str(core_hmac_sha1(key, data));
}
/*
 * Perform a simple self-test to see if the VM is working
 */
function sha1_vm_test() {
    return hex_sha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d";
}
/*
 * Calculate the SHA-1 of an array of big-endian words, and a bit length
 */
function core_sha1(x, len) {
    /* append padding */
    x[len >> 5] |= 0x80 << (24 - len % 32);
    x[((len + 64 >> 9) << 4) + 15] = len;
    var w = Array(80);
    var a = 1732584193;
    var b = -271733879;
    var c = -1732584194;
    var d = 271733878;
    var e = -1009589776;
    for (var i = 0; i < x.length; i += 16) {
        var olda = a;
        var oldb = b;
        var oldc = c;
        var oldd = d;
        var olde = e;
        for (var j = 0; j < 80; j++) {
            if (j < 16) w[j] = x[i + j];
            else w[j] = rol(w[j - 3] ^ w[j - 8] ^ w[j - 14] ^ w[j - 16], 1);
            var t = safe_add(safe_add(rol(a, 5), sha1_ft(j, b, c, d)), safe_add(safe_add(e, w[j]), sha1_kt(j)));
            e = d;
            d = c;
            c = rol(b, 30);
            b = a;
            a = t;
        }
        a = safe_add(a, olda);
        b = safe_add(b, oldb);
        c = safe_add(c, oldc);
        d = safe_add(d, oldd);
        e = safe_add(e, olde);
    }
    return Array(a, b, c, d, e);
}
/*
 * Perform the appropriate triplet combination function for the current
 * iteration
 */
function sha1_ft(t, b, c, d) {
    if (t < 20) return (b & c) | ((~b) & d);
    if (t < 40) return b ^ c ^ d;
    if (t < 60) return (b & c) | (b & d) | (c & d);
    return b ^ c ^ d;
}
/*
 * Determine the appropriate additive constant for the current iteration
 */
function sha1_kt(t) {
    return (t < 20) ? 1518500249 : (t < 40) ? 1859775393 : (t < 60) ? -1894007588 : -899497514;
}
/*
 * Calculate the HMAC-SHA1 of a key and some data
 */
function core_hmac_sha1(key, data) {
    var bkey = str2binb(key);
    if (bkey.length > 16) bkey = core_sha1(bkey, key.length * chrsz);
    var ipad = Array(16),
        opad = Array(16);
    for (var i = 0; i < 16; i++) {
        ipad[i] = bkey[i] ^ 0x36363636;
        opad[i] = bkey[i] ^ 0x5C5C5C5C;
    }
    var hash = core_sha1(ipad.concat(str2binb(data)), 512 + data.length * chrsz);
    return core_sha1(opad.concat(hash), 512 + 160);
}
/*
 * Add integers, wrapping at 2^32. This uses 16-bit operations internally
 * to work around bugs in some JS interpreters.
 */
function safe_add(x, y) {
    var lsw = (x & 0xFFFF) + (y & 0xFFFF);
    var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
    return (msw << 16) | (lsw & 0xFFFF);
}
/*
 * Bitwise rotate a 32-bit number to the left.
 */
function rol(num, cnt) {
    return (num << cnt) | (num >>> (32 - cnt));
}
/*
 * Convert an 8-bit or 16-bit string to an array of big-endian words
 * In 8-bit function, characters >255 have their hi-byte silently ignored.
 */
function str2binb(str) {
    var bin = Array();
    var mask = (1 << chrsz) - 1;
    for (var i = 0; i < str.length * chrsz; i += chrsz)
        bin[i >> 5] |= (str.charCodeAt(i / chrsz) & mask) << (24 - i % 32);
    return bin;
}
/*
 * Convert an array of big-endian words to a string
 */
function binb2str(bin) {
    var str = "";
    var mask = (1 << chrsz) - 1;
    for (var i = 0; i < bin.length * 32; i += chrsz)
        str += String.fromCharCode((bin[i >> 5] >>> (24 - i % 32)) & mask);
    return str;
}
/*
 * Convert an array of big-endian words to a hex string.
 */
function binb2hex(binarray) {
    var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
    var str = "";
    for (var i = 0; i < binarray.length * 4; i++) {
        str += hex_tab.charAt((binarray[i >> 2] >> ((3 - i % 4) * 8 + 4)) & 0xF) + hex_tab.charAt((binarray[i >> 2] >> ((3 - i % 4) * 8)) & 0xF);
    }
    return str;
}
/*
 * Convert an array of big-endian words to a base-64 string
 */
function binb2b64(binarray) {
    var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
    var str = "";
    for (var i = 0; i < binarray.length * 4; i += 3) {
        var triplet = (((binarray[i >> 2] >> 8 * (3 - i % 4)) & 0xFF) << 16) | (((binarray[i + 1 >> 2] >> 8 * (3 - (i + 1) % 4)) & 0xFF) << 8) | ((binarray[i + 2 >> 2] >> 8 * (3 - (i + 2) % 4)) & 0xFF);
        for (var j = 0; j < 4; j++) {
            if (i * 8 + j * 6 > binarray.length * 32) str += b64pad;
            else str += tab.charAt((triplet >> 6 * (3 - j)) & 0x3F);
        }
    }
    return str;
}
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值