小编ank*_*kur的帖子

该请求缺少Authentification Key FCM Token

我试图使用postman firebase网址,但它给了我错误.我已经设置了所有的东西,但它仍然给我错误

这是我对邮递员的错误

<HTML>
    <HEAD>
        <TITLE>The request was missing an Authentification Key (FCM Token). Please, refer to section &quot;Authentification&quot; of the FCM documentation, at https://firebase.google.com/docs/cloud-messaging/server.</TITLE>
    </HEAD>
    <BODY BGCOLOR="#FFFFFF" TEXT="#000000">
        <H1>The request was missing an Authentification Key (FCM Token). Please, refer to section &quot;Authentification&quot; of the FCM documentation, at https://firebase.google.com/docs/cloud-messaging/server.</H1>
        <H2>Error 401</H2>
    </BODY>
</HTML>


These things I am adding <br/>
url = 'https://fcm.googleapis.com/fcm/send'<br/>
method = POST<br/>
Headers <br/>
Authorization = 'FIREBASE_SERVER_API_KEY'<br/>
Content-Type = application/json<br/>
Body = 
"{"registration_ids":["ids"],"priority":"high\",\"data\":{\"notification_id\":76,\"title\":\"dvxcv\",\"description\":\"xcvxv\",\"image\":\"/uploads/image/image/37513/Screenshot_from_2016-10-17_10_43_59.png\"}}"
Run Code Online (Sandbox Code Playgroud)

ruby ruby-on-rails firebase ruby-on-rails-4 firebase-cloud-messaging

7
推荐指数
1
解决办法
5183
查看次数

矩阵求和挑战

下面的算法用于将“下矩阵”转换为“后矩阵”。给定“后矩阵”,找到“前矩阵”。

矩阵

该算法针对每个 after(x,y) 运行以确定它们的值。给定之后,找到之前的原始值

例子

之后 = [[2,5],[7,17]]

从之前计算之后的值

after[0][0] = before[0][0] = 2

after[0][1] = before[0][0] + before[0][1] = 2 + 3 = 5

after[1][0] = before[0][0] + before[1][0] = 2 + 5 = 7

after[1][1] = before[0][0] + before[0][1] + before[1][0] + before[1][1] = 2 + 3 + 5 + 7 =  17
Run Code Online (Sandbox Code Playgroud)

完成函数 find before matrix 具有以下参数 after[n][m]: 一个 nxm 整数数组

返回: int[n][m] 表示前矩阵的 nxm 整数数组

约束

再输入一个样本

输入1

到目前为止我尝试过的

n = gets.to_i
m = gets.to_i

arr = …
Run Code Online (Sandbox Code Playgroud)

ruby algorithm

2
推荐指数
1
解决办法
4787
查看次数