HQBUPT的专栏

int numDecodings(string s) { if (s.length() == 0 || s[0] == '0') { return 0; } else if (s.length() == 1) { return 1; } int numWithoutLastTwo = 1, numWithoutLastOne = 1, num = 0; for (int

string convert(string s, int nRows) { if (nRows <= 1) { return s; } string* rowStr = new string[nRows]; bool down = true; int i = 0, row = 0; while (i < s.length()) { if (down) { row

#include using namespace std;stringstream strStream;string str = "-123";stream<<str;int val;stream>>val;

string countAndSay(string s) { string result; int index1 = 0, index2 = 0, count = 0; while(index1 < s.length()) { if (s[index2] == s[index1]) { count++; index2++; } if (index2 =

vector anagrams(vector &strs) { map hashTable; for (int i = 0; i < strs.size(); i++) { string str = strs[i]; sort(str.begin(), str.end()); if (hashTable.count(str) == 0) { hashTable[str]

vector > threeSum(vector &num) { sort(num.begin(), num.end()); vector> triplets; int n = num.size(); if (n == 0) { return triplets; } int lastNum = num[0] + 1; for (int aIndex = 0; aIndex <

vector insert(vector &intervals, Interval newInterval) { int beg = intervals.size(), end = intervals.size()-1; bool getBeg = false; for (int i = 0; i < intervals.size(); i++) { if (newInterval.s

string longestCommonPrefix(vector &strs) { string commonPrefix; if(strs.empty()) { return commonPrefix; } int index = 0; while(1) { for(int i = 0; i < strs.size(); i++) { string str = strs

double pow(double x, int n) { if (n == INT_MIN) { return 1.0/(pow(x, -(n+1))*x); } else if(n < 0) { return 1.0/pow(x, -n); } else if(n == 0) { return 1.0; } else if (n == 1) { retur

vector twoSum(vector &numbers, int target) { vector twoIndex; map numIndex; for(int i = 0; i < numbers.size(); i++) { int num = target - numbers[i]; if(!numIndex.count(num)) { numIndex[numbe

int longestConsecutive(vector &num) { map map; for (int i = 0; i < num.size(); i++) { map[num[i]] = true; } int maxLen = 0; for (int i = 0; i < num.size(); i++) { if (map[num[i]] == tru

char *strStr(char *haystack, char *needle) { if (haystack == NULL || needle == NULL){ return NULL; } int haystack_len = strlen(haystack); int needle_len = strlen(needle); for(int i = 0; i <= ha

int candy(vector &ratings) { int n = ratings.size(); int* candy = new int[n]; for(int i = 0; i < n; i++) { candy[i] = 1; } for(int i = 1; i < n; i++) { if(ratings[i] > ratings[i-1] && candy[i

Joint Bayesian Face Verification

bool isPalindrome(int x) { if (x < 0) { return false; } int xReverse = 0; int xTmp = x; while (xTmp != 0) { if (xReverse > INT_MAX/10) { return false; } xReverse *= 10; if ((IN

int atoi(const char *str) { if (str == NULL) { return 0; } while (*str == ' ') { str++; } bool negative = false; if (*str == '+') { negative = false; str++; } else if (*str == '-')

bool isPalindrome(string s) { int left = 0, right = s.length()-1; while (left <= right) { char leftChar = s[left]; if (!((leftChar >= '0' && leftChar = 'a' && leftChar = 'A' && leftChar <= 'Z')

vector inorderTraversal(TreeNode *root) { vector pre_node; vector val; if (root == NULL) { return val; } pre_node.push_back(root); while(!pre_node.empty()) { TreeNode* cur_node = pre_node

ListNode *partition(ListNode *head, int x) { ListNode* virtualHead = new ListNode(-1); virtualHead->next = head; ListNode* lessNode = virtualHead; ListNode* preNode = virtualHead; ListNode* curNo

bool search(int A[], int n, int target) { int beg = 0, end = n-1; while (beg <= end) { int mid = (beg+end)/2; if (A[beg] < A[end]) { if (target < A[mid]) { end = mid - 1; }