前往小程序,Get更优阅读体验!
立即前往
首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >php编程之小程序支付所需规避的问题

php编程之小程序支付所需规避的问题

原创
作者头像
用户7847861
修改2020-10-13 17:58:59
6410
修改2020-10-13 17:58:59
举报
文章被收录于专栏:小时光_PHP小时光_PHP

对于开发一款小程序来说,经常是需要做支付功能的,但是大家在做这个功能的时候,往往会发现遇到很多自己无法解决的问题,那么对于这个问题,我们自己也曾遇到过,下面就跟大家详细来分析解答一下吧。

首先是在商户平台填写支付链接,必须是(http或https开头,最多填写5个);填写回调地址(只能填写一个),首先我们把官方的demo下载下来放在项目vendor目录下

然后在lib/wxPay.Config.php

设置参数

接下来就是统一下单:因为这里我要用到两次支付,但是支付链接只能有一个地址

本以为数据返回之后,就可以利用wx.requestPayment调用支付了,但是老是会报:签名验证失败

后来上网查过之后才明白小程序wx.requestPayment里的paySign并不是统一下单时候的Sign,而是要重新生成一个签名,生成如下图所示:(现在才知道之前要定义appid了吧)

但是这样写完发现还是不行,报MD5的错误,所以要在js中引入MD5文件(我放在了utils目录下)

Md5.js内容如下:

/***********************************************************************/

/*

* A JavaScript implementation of the RSA Data Security, Inc. MD5 Message

* Digest Algorithm, as defined in RFC 1321.

* Version 1.1 Copyright (C) Paul Johnston 1999 - 2002.

* Code also contributed by Greg Holt

* See http://pajhome.org.uk/site/legal.html for details.

*/

/*

* 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))

}

/*

* These functions implement the four basic operations the algorithm uses.

*/

function cmn(q, a, b, x, s, t) {

return safe_add(rol(safe_add(safe_add(a, q), safe_add(x, t)), s), b)

}

function ff(a, b, c, d, x, s, t) {

return cmn((b & c) | ((~b) & d), a, b, x, s, t)

}

function gg(a, b, c, d, x, s, t) {

return cmn((b & d) | (c & (~d)), a, b, x, s, t)

}

function hh(a, b, c, d, x, s, t) {

return cmn(b ^ c ^ d, a, b, x, s, t)

}

function ii(a, b, c, d, x, s, t) {

return cmn(c ^ (b | (~d)), a, b, x, s, t)

}

/*

* Calculate the MD5 of an array of little-endian words, producing an array

* of little-endian words.

*/

function coreMD5(x) {

var a = 1732584193

var b = -271733879

var c = -1732584194

var d = 271733878

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

var olda = a

var oldb = b

var oldc = c

var oldd = d

a = ff(a, b, c, d, x[i + 0], 7, -680876936)

d = ff(d, a, b, c, x[i + 1], 12, -389564586)

c = ff(c, d, a, b, x[i + 2], 17, 606105819)

b = ff(b, c, d, a, x[i + 3], 22, -1044525330)

a = ff(a, b, c, d, x[i + 4], 7, -176418897)

d = ff(d, a, b, c, x[i + 5], 12, 1200080426)

c = ff(c, d, a, b, x[i + 6], 17, -1473231341)

b = ff(b, c, d, a, x[i + 7], 22, -45705983)

a = ff(a, b, c, d, x[i + 8], 7, 1770035416)

d = ff(d, a, b, c, x[i + 9], 12, -1958414417)

c = ff(c, d, a, b, x[i + 10], 17, -42063)

b = ff(b, c, d, a, x[i + 11], 22, -1990404162)

a = ff(a, b, c, d, x[i + 12], 7, 1804603682)

d = ff(d, a, b, c, x[i + 13], 12, -40341101)

c = ff(c, d, a, b, x[i + 14], 17, -1502002290)

b = ff(b, c, d, a, x[i + 15], 22, 1236535329)

a = gg(a, b, c, d, x[i + 1], 5, -165796510)

d = gg(d, a, b, c, x[i + 6], 9, -1069501632)

c = gg(c, d, a, b, x[i + 11], 14, 643717713)

b = gg(b, c, d, a, x[i + 0], 20, -373897302)

a = gg(a, b, c, d, x[i + 5], 5, -701558691)

d = gg(d, a, b, c, x[i + 10], 9, 38016083)

c = gg(c, d, a, b, x[i + 15], 14, -660478335)

b = gg(b, c, d, a, x[i + 4], 20, -405537848)

a = gg(a, b, c, d, x[i + 9], 5, 568446438)

d = gg(d, a, b, c, x[i + 14], 9, -1019803690)

c = gg(c, d, a, b, x[i + 3], 14, -187363961)

b = gg(b, c, d, a, x[i + 8], 20, 1163531501)

a = gg(a, b, c, d, x[i + 13], 5, -1444681467)

d = gg(d, a, b, c, x[i + 2], 9, -51403784)

c = gg(c, d, a, b, x[i + 7], 14, 1735328473)

b = gg(b, c, d, a, x[i + 12], 20, -1926607734)

a = hh(a, b, c, d, x[i + 5], 4, -378558)

d = hh(d, a, b, c, x[i + 8], 11, -2022574463)

c = hh(c, d, a, b, x[i + 11], 16, 1839030562)

b = hh(b, c, d, a, x[i + 14], 23, -35309556)

a = hh(a, b, c, d, x[i + 1], 4, -1530992060)

d = hh(d, a, b, c, x[i + 4], 11, 1272893353)

c = hh(c, d, a, b, x[i + 7], 16, -155497632)

b = hh(b, c, d, a, x[i + 10], 23, -1094730640)

a = hh(a, b, c, d, x[i + 13], 4, 681279174)

d = hh(d, a, b, c, x[i + 0], 11, -358537222)

c = hh(c, d, a, b, x[i + 3], 16, -722521979)

b = hh(b, c, d, a, x[i + 6], 23, 76029189)

a = hh(a, b, c, d, x[i + 9], 4, -640364487)

d = hh(d, a, b, c, x[i + 12], 11, -421815835)

c = hh(c, d, a, b, x[i + 15], 16, 530742520)

b = hh(b, c, d, a, x[i + 2], 23, -995338651)

a = ii(a, b, c, d, x[i + 0], 6, -198630844)

d = ii(d, a, b, c, x[i + 7], 10, 1126891415)

c = ii(c, d, a, b, x[i + 14], 15, -1416354905)

b = ii(b, c, d, a, x[i + 5], 21, -57434055)

a = ii(a, b, c, d, x[i + 12], 6, 1700485571)

d = ii(d, a, b, c, x[i + 3], 10, -1894986606)

c = ii(c, d, a, b, x[i + 10], 15, -1051523)

b = ii(b, c, d, a, x[i + 1], 21, -2054922799)

a = ii(a, b, c, d, x[i + 8], 6, 1873313359)

d = ii(d, a, b, c, x[i + 15], 10, -30611744)

c = ii(c, d, a, b, x[i + 6], 15, -1560198380)

b = ii(b, c, d, a, x[i + 13], 21, 1309151649)

a = ii(a, b, c, d, x[i + 4], 6, -145523070)

d = ii(d, a, b, c, x[i + 11], 10, -1120210379)

c = ii(c, d, a, b, x[i + 2], 15, 718787259)

b = ii(b, c, d, a, x[i + 9], 21, -343485551)

a = safe_add(a, olda)

b = safe_add(b, oldb)

c = safe_add(c, oldc)

d = safe_add(d, oldd)

}

return [a, b, c, d]

}

/*

* Convert an array of little-endian words to a hex string.

*/

function binl2hex(binarray) {

var hex_tab = "0123456789abcdef"

var str = ""

for (var i = 0; i < binarray.length * 4; i++) {

str += hex_tab.charAt((binarray[i >> 2] >> ((i % 4) * 8 + 4)) & 0xF) +

hex_tab.charAt((binarray[i >> 2] >> ((i % 4) * 8)) & 0xF)

}

return str

}

/*

* Convert an array of little-endian words to a base64 encoded string.

*/

function binl2b64(binarray) {

var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"

var str = ""

for (var i = 0; i < binarray.length * 32; i += 6) {

str += tab.charAt(((binarray[i >> 5] << (i % 32)) & 0x3F) |

((binarray[i >> 5 + 1] >> (32 - i % 32)) & 0x3F))

}

return str

}

/*

* Convert an 8-bit character string to a sequence of 16-word blocks, stored

* as an array, and append appropriate padding for MD4/5 calculation.

* If any of the characters are >255, the high byte is silently ignored.

*/

function str2binl(str) {

var nblk = ((str.length + 8) >> 6) + 1 // number of 16-word blocks

var blks = new Array(nblk * 16)

for (var i = 0; i < nblk * 16; i++) blks[i] = 0

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

blks[i >> 2] |= (str.charCodeAt(i) & 0xFF) << ((i % 4) * 8)

blks[i >> 2] |= 0x80 << ((i % 4) * 8)

blks[nblk * 16 - 2] = str.length * 8

return blks

}

/*

* Convert a wide-character string to a sequence of 16-word blocks, stored as

* an array, and append appropriate padding for MD4/5 calculation.

*/

function strw2binl(str) {

var nblk = ((str.length + 4) >> 5) + 1 // number of 16-word blocks

var blks = new Array(nblk * 16)

for (var i = 0; i < nblk * 16; i++) blks[i] = 0

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

blks[i >> 1] |= str.charCodeAt(i) << ((i % 2) * 16)

blks[i >> 1] |= 0x80 << ((i % 2) * 16)

blks[nblk * 16 - 2] = str.length * 16

return blks

}

/*

* External interface

*/

function hexMD5(str) { return binl2hex(coreMD5(str2binl(str))) }

function hexMD5w(str) { return binl2hex(coreMD5(strw2binl(str))) }

function b64MD5(str) { return binl2b64(coreMD5(str2binl(str))) }

function b64MD5w(str) { return binl2b64(coreMD5(strw2binl(str))) }

/* Backward compatibility */

function calcMD5(str) { return binl2hex(coreMD5(str2binl(str))) }

module.exports = {

hexMD5: hexMD5

}

/***********************************************************************/

然后在js中引入

至此参数都有了就可以调用:wx.requestPayment

之后就是回调函数;回调方法接收统一下单方法返回的值,可以这样做,在xcxpay方法里是用&链接的,现在用&分割就可以得到想要的数据,再做处理就Ok!

最麻烦的一点就是微信如果收不到返回的通知就会不停的回调,所以在里边一定要加判断

告诉微信你已经接到过通知 返回”success”;至此小程序微信支付就搞定了,现在大家通过学习已经知道要规避哪些问题了吧,也知道具体出错在哪里了吧,那么如果还存在有疑问的,可以留言咨询,或者联系16650234615。

原创声明:本文系作者授权腾讯云开发者社区发表,未经许可,不得转载。

如有侵权,请联系 cloudcommunity@tencent.com 删除。

原创声明:本文系作者授权腾讯云开发者社区发表,未经许可,不得转载。

如有侵权,请联系 cloudcommunity@tencent.com 删除。

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
相关产品与服务
云开发 CloudBase
云开发(Tencent CloudBase,TCB)是腾讯云提供的云原生一体化开发环境和工具平台,为200万+企业和开发者提供高可用、自动弹性扩缩的后端云服务,可用于云端一体化开发多种端应用(小程序、公众号、Web 应用等),避免了应用开发过程中繁琐的服务器搭建及运维,开发者可以专注于业务逻辑的实现,开发门槛更低,效率更高。
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档