摘要：
Given an array of integers nums, write a method that returns the "pivot" index of this array. We define the pivot index as the index where the sum of 阅读全文
阅读排行榜
[LeetCode] 67. Add Binary_Easy tag: String
2018-08-13 04:05 by Johnson_强生仔仔, 206 阅读, 收藏,
摘要：
Given two binary strings, return their sum (also a binary string). The input strings are both non-empty and contains only characters 1 or 0. Example 1 阅读全文
[LeetCode] 224. Basic Calculator_Hard tag: stack
2019-08-01 10:46 by Johnson_强生仔仔, 205 阅读, 收藏,
摘要：
Implement a basic calculator to evaluate a simple expression string. The expression string may contain open ( and closing parentheses ), the plus + or 阅读全文
[LeetCode] 161. One Edit Distance_Medium
2018-07-20 03:45 by Johnson_强生仔仔, 205 阅读, 收藏,
摘要：
Given two strings s and t, determine if they are both one edit distance apart. Note: There are 3 possiblities to satisify one edit distance apart: Exa 阅读全文
[LeetCode] 99. Recover Binary Search Tree_Hard_Inorder traversal
2018-08-07 23:37 by Johnson_强生仔仔, 204 阅读, 收藏,
摘要：
Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure. Example 1: Input: [1,3,null,null,2 阅读全文
浙公网安备 33010602011771号