Rotate Vector To Orthogonal Direction Just like in the picture, we will rotate vector to which is orthogonal to the neighbor . The vector is the cross product of and . #include <iostream> #include “point.hpp” int main() { Point m( Read more…
The article shows how to combine two mesh objects to one based on VTK. The code snippet is in the following part. #include <iostream> #include <vtkSmartPointer.h> #include <vtkSphereSource.h> #include <vtkActor.h> #include <vtkConeSource.h> #include <vtkRenderer.h> #include <vtkRenderWindow.h> #include <vtkPolyDataMapper.h> #include <vtkRenderWindowInteractor.h> Read more…
I write a few file IO functions which are used in windows and mac os x. bool CopyAFile(const std::string inFile, const std::string outFile); bool RemoveFile(const std::string filePath); void RemoveDir(const std::string folderPath); void MoveAFile(const std::string oldFile, const std::string newFile); void CheckFolderExist(const Read more…
Add subdirectories and use VTK library and Qt in my projects. The file structure looks like the following image. projectB generates lib and dll files which will be used by projectA. projectA show a window and print message from Base Read more…
typeid.name The function typeid.name can give us the information about variable. Header file: typeinfo #include <typeinfo> int main() { vector<bool> vec{ false, true }; auto ans = vec[0]; cout << typeid(ans).name() << endl; bool tmp = false; cout << typeid(tmp).name() Read more…
Exercises: 232. Implement Queue using Stacks Implement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue (push, peek, pop, and empty). Solution: take advantage of the features of both stacks Read more…
Exercises: 448. Find All Numbers Disappeared in an Array Given an array nums of n integers where nums[i] is in the range [1, n], return an array of all the integers in the range [1, n] that do not appear in nums. Solution: use set to record all numbers had showed and Read more…
Exercises: 461. Hamming Distance Calculate the number of positions at which the corresponding bits are different. Solution: Do XOR and find the number of 1. class Solution { public: int hammingDistance(int x, int y) { int tmp = x ^ y; Read more…