LeetCode
文章平均质量分 70
purple尘
这个作者很懒,什么都没留下…
展开
-
LeetCode:Reverse Words in a String
class Solution {public: void reverseWords(string &s) { int a, b; int len = s.length(); //注意判断s是否一开始就为空、或者s全为空格 if(!len){ return ; } //原创 2014-05-07 17:38:06 · 584 阅读 · 0 评论 -
6. ZigZag Conversion
水题。class Solution { public: string convert(string s, int numRows) {原创 2017-11-27 00:52:53 · 198 阅读 · 0 评论 -
5. Longest Palindromic Substring
水题,注意时间复杂度不要超过O(n^2)。class Solution { public: string longestPalindrome(string s) { string ans; int ans_length = 0; int length = s.length();原创 2017-11-27 00:26:28 · 175 阅读 · 0 评论 -
3. Longest Substring Without Repeating Characters
水题。class Solution { public: int lengthOfLongestSubstring(string s) { char flag[256]; int length = s.length();原创 2017-11-26 23:17:52 · 193 阅读 · 0 评论 -
1. Two Sum
水题。class Solution { public: vector twoSum(vector& nums, int target) { vector result; int i原创 2017-11-26 22:54:39 · 160 阅读 · 0 评论 -
26. Remove Duplicates from Sorted Array
水题。class Solution { public: int removeDuplicates(vector& nums) { if (nums.empty()) { return 0; } int diff_cnt = 1; f原创 2017-11-26 22:31:34 · 187 阅读 · 0 评论 -
81. Search in Rotated Sorted Array II
水题。class Solution { public: bool search(vector& nums, int target) { if (nums.empty()) { return false; } for (int i = 0; i原创 2017-12-02 00:07:14 · 192 阅读 · 0 评论 -
33. Search in Rotated Sorted Array
水题。class Solution { public: int search(vector& nums, int target) { // empty if (nums.empty()) { return -1;原创 2017-11-29 01:11:21 · 201 阅读 · 0 评论 -
80. Remove Duplicates from Sorted Array II
水题。class Solution { public: int removeDuplicates(vector& nums) { if (nums.empty()) { return 0; }原创 2017-11-29 00:05:45 · 139 阅读 · 0 评论 -
7. Reverse Integer
水题。class Solution {原创 2017-11-28 00:14:32 · 193 阅读 · 0 评论