1+ {
2+ "data" : {
3+ "question" : {
4+ "questionId" : " 2768" ,
5+ "questionFrontendId" : " 2774" ,
6+ "categoryTitle" : " JavaScript" ,
7+ "boundTopicId" : 2341825 ,
8+ "title" : " Array Upper Bound" ,
9+ "titleSlug" : " array-upper-bound" ,
10+ "content" : null ,
11+ "translatedTitle" : " 数组的上界" ,
12+ "translatedContent" : null ,
13+ "isPaidOnly" : true ,
14+ "difficulty" : " Easy" ,
15+ "likes" : 0 ,
16+ "dislikes" : 0 ,
17+ "isLiked" : null ,
18+ "similarQuestions" : " []" ,
19+ "contributors" : [],
20+ "langToValidPlayground" : null ,
21+ "topicTags" : [],
22+ "companyTagStats" : null ,
23+ "codeSnippets" : null ,
24+ "stats" : " {\" totalAccepted\" : \" 15\" , \" totalSubmission\" : \" 19\" , \" totalAcceptedRaw\" : 15, \" totalSubmissionRaw\" : 19, \" acRate\" : \" 78.9%\" }" ,
25+ "hints" : [
26+ " Inside the Array.prototype.upperBound function you have access to the \" this\" keyword. You can access array elements, values, and methods. For example \" this[0]\" , \" this[1]\" , \" this.length\" , \" this.map()\" , etc." ,
27+ " The most efficient way to solve this problem is with binary search." ,
28+ " Choose the middle element and check if it's less than or equal to the goal value. If so, you can rule out the left side of the array."
29+ ],
30+ "solution" : null ,
31+ "status" : null ,
32+ "sampleTestCase" : " [3,4,5]\n 5" ,
33+ "metaData" : " {\n \" name\" : \" upperBound\" ,\n \" params\" : [\n {\n \" name\" : \" nums\" ,\n \" type\" : \" integer[]\"\n },\n {\n \" type\" : \" integer\" ,\n \" name\" : \" target\"\n }\n ],\n \" return\" : {\n \" type\" : \" integer\"\n },\n \" languages\" : [\n \" javascript\" ,\n \" typescript\"\n ],\n \" manual\" : true\n }" ,
34+ "judgerAvailable" : true ,
35+ "judgeType" : " large" ,
36+ "mysqlSchemas" : [],
37+ "enableRunCode" : true ,
38+ "envInfo": "{\"javascript\":[\"JavaScript\",\"<p>\\u7248\\u672c\\uff1a<code>Node.js 16.13.2<\\/code><\\/p>\\r\\n\\r\\n<p>\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a <code>--harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f <a href=\\\"http:\\/\\/node.green\\/\\\" target=\\\"_blank\\\">\\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n<p><a href=\\\"https:\\/\\/lodash.com\\\" target=\\\"_blank\\\">lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n<p> \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 <a href=\\\"https:\\/\\/github.com\\/datastructures-js\\/priority-queue\\/tree\\/fb4fdb984834421279aeb081df7af624d17c2a03\\\" target=\\\"_blank\\\"> datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c <a href=\\\"https:\\/\\/github.com\\/datastructures-js\\/queue\\/tree\\/e63563025a5a805aa16928cb53bcd517bfea9230\\\" target=\\\"_blank\\\"> datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"typescript\":[\"TypeScript\",\"<p>TypeScript 5.1.6<\\/p>\\r\\n\\r\\n<p>Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n<p><a href=\\\"https:\\/\\/lodash.com\\\" target=\\\"_blank\\\">lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n<p> \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 <a href=\\\"https:\\/\\/github.com\\/datastructures-js\\/priority-queue\\/tree\\/fb4fdb984834421279aeb081df7af624d17c2a03\\\" target=\\\"_blank\\\"> datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c <a href=\\\"https:\\/\\/github.com\\/datastructures-js\\/queue\\/tree\\/e63563025a5a805aa16928cb53bcd517bfea9230\\\" target=\\\"_blank\\\"> datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"]}",
39+ "book" : null ,
40+ "isSubscribed" : false ,
41+ "isDailyQuestion" : false ,
42+ "dailyRecordStatus" : null ,
43+ "editorType" : " CKEDITOR" ,
44+ "ugcQuestionId" : null ,
45+ "style" : " LEETCODE" ,
46+ "exampleTestcases" : " [3,4,5]\n 5\n [1,4,5]\n 2\n [3,4,6,6,6,6,7]\n 6" ,
47+ "__typename" : " QuestionNode"
48+ }
49+ }
50+ }
0 commit comments