philip_puma的专栏

一. 前言看了分治法的部分，

问题Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a triple

问题Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Inpu

问题代码class Solution {public: ListNode *removeNthFromEnd(ListNode *head, int n) { if (!head) { return head; } ListNode *temp = head; ListNode *probe = NULL; ListNode *prev =

问题代码分析总结

问题代码分析分析2总结

问题代码class Solution {public: string longestCommonPrefix(vector &strs) { int len = strs.size(); if (len == 1) { return strs[0]; } if (len == 0) { return ""; } st

问题代码分析总结

问题Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are

问题代码class Solution {public: int removeDuplicates(int A[], int n) { if (n == 0 || n == 1) { return n; } int flag = A[0]; int slot = 1; for (int i = 1 ; i < n ; i++) {

问题Implement strStr().Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack.代码int hashCode(char* needle , int c){ int hashcode = 0;

问题Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant

问题Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the end should remain

问题代码分析总结

问题Implement regular expression matching with support for '.' and '*'.'.' Matches any single character.'*' Matches zero or more of the preceding element.The matching should cover the entire

问题Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible

Mac下GDB不太好用在Mac下使用gdb调试bi

void merge(int* A , int p , int q , int r){ static int counter =0; printf("%d st int here\n" , counter ++); /* create two arrays */ int LASize = (q - p + 1); int RaSize = (r - q +

//// toSum.cpp// Test//// Created by mac on 5/18/14.// Copyright (c) 2014 mac. All rights reserved.//#include "toSum.h"#include #include #include using namespace std;struct node{

问题：代码：//// lssworc.cpp// Test//// Created by mac on 5/19/14.// Copyright (c) 2014 mac. All rights reserved.//#include "lssworc.h"#include #include #include using namespace std;

问题：代码：分析：总结：

问题：There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).代码：分析:总结：

问题代码分析总结

问题代码分析jieg

问题代码分析总结

问题：ZigZag

问题Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321代码分析总结

问题代码分析总结

问题代码class Solution {public: int removeElement(int A[], int n, int elem) { if (n == 0) { return n; } int slot = 0; for (int i = 0 ; i < n ; i++) { if (elem == A[i]) { con