LeetCode
acceptedwwh
当代大学生,阳光开朗,乐于交往和求知!
展开
-
434. Number of Segments in a String
class Solution {public: int countSegments(string s) { bool flag = false; int len = s.length(); int cnt = 0; for(int i = 0; i < len; i++) { if(false == f原创 2017-01-09 20:32:48 · 283 阅读 · 0 评论 -
419. Battleships in a Board
Given an 2D board, count how many different battleships are in it. The battleships are represented with ‘X’s, empty slots are represented with ‘.’s. You may assume the following rules:You receive a val原创 2017-01-10 21:20:15 · 292 阅读 · 0 评论 -
[LeetCode]312. Burst Balloons
思考:上周日做了爱奇艺的算法比赛,被通知无缘复赛,虽然没有为这个比赛准备什么,可心里觉得还是有些不爽!学习如逆水行舟,不进则退!再过段时间就是校园招聘了,该好好加强一下算法功底了! 这道题目和算法导论上面的“矩阵连乘”,“Floyd最短路算法“还有“石子合并问题(直线版)” 有相似之处! 题目链接import java.util.Scanner;class Solution1 { pu转载 2017-05-16 09:27:45 · 430 阅读 · 0 评论 -
LeetCode专辑]【1-5题】
第一题:1. Two Sumclass Solution {public: vector<int> twoSum(vector<int>& nums, int target) { vector<int> res; for(int i = 0; i < nums.size(); i++) { for(int j = i + 1; j <原创 2017-05-16 19:35:10 · 678 阅读 · 0 评论 -
LeetCode专辑]【6-10题】
第七题:7. Reverse Integer 思考:32为整形范围是:-2147483648-2147483648 比如:1534236469 翻转一下就溢出了,负数同理。#include <cstdlib>#include <cstdio>#include <vector>#include <algorithm>#include <iostream>#include <cmath>原创 2017-05-17 21:27:55 · 502 阅读 · 0 评论 -
LeedCode题目
Partition List public ListNode partition(ListNode head, int x) { if(head == null) { return null; } ListNode newHeadNode = null; ListNode lastNode = null; for (ListNode i...原创 2018-07-07 23:21:44 · 412 阅读 · 0 评论