https://leetcode-cn.com/problems/two-sum/1. 两数之和给定一个整数数组num`
https://leetcode-cn.com/problems/kth-largest-element-in-an-array用普通的定长(k)数组作为容器,元素从小到大排列, 遍历列表中的元素,始终维持k个有效元素。最后取第0个元素就是第k大的元素。function H(/* int */cap) { this.repo = []; this.cap = cap;...
https://leetcode.com/problems/integer-to-roman/submissions/* 12.php<?phpclass Solution { // a[0] > a[1] > a[2] ... private static function indexLessThan($a, $ans, $start=0...
* Solution.javapackage com.leetcode.romanToInteger;public class Solution { public int romanToInt(String s) { String t = "IVXLCDM"; int []weight = {1, 5, 10, 50, 100, 500, 10...
https://leetcode.com/problems/longest-common-prefix/submissions/Approach 1: Horizontal scanning* Solution.php<?phpclass Solution { /** * @param $haystack string * @param $...
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号